Result 1 to 20 of 121 total
A mixed integer programming model for the cyclic job-shop problem with transportation. (English)
Discrete Appl. Math. 160, No. 13-14, 1924-1935 (2012).
1
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. (English)
J. Sched. 14, No. 4, 371-389 (2011).
2
Inverse scheduling: Two-machine flow-shop problem. (English)
J. Sched. 14, No. 3, 239-256 (2011).
3
Personnel scheduling: models and complexity. (English)
Eur. J. Oper. Res. 210, No. 3, 467-473 (2011).
4
A shift sequence based approach for nurse scheduling and a new benchmark dataset. (English)
J. Heuristics 16, No. 4, 559-573 (2010).
5
Inverse scheduling with maximum lateness objective. (English)
J. Sched. 12, No. 5, 475-488 (2009).
6
Job-shop scheduling problem (English)
Encyclopedia of Optimization, 1782-1788 (2009).
7
Scheduling jobs with equal processing times and time windows on identical parallel machines. (English)
J. Sched. 11, No. 4, 229-237 (2008).
8
A general model for cyclic machine scheduling problems. (English)
Discrete Appl. Math. 156, No. 13, 2561-2572 (2008).
9
Cyclic job shop scheduling problems with blocking. (English)
Ann. Oper. Res. 159, 161-181 (2008).
10
Complexity of shop-scheduling problems with fixed number of jobs: a survey. (English)
Math. Methods Oper. Res. 65, No. 3, 461-481 (2007).
11
The complexity of mean flow time scheduling problems with release times. (English)
J. Sched. 10, No. 2, 139-146 (2007).
12
Scheduling algorithms. 5th ed. (English)
Berlin: Springer (ISBN 978-3-540-69515-8/hbk). xii, 371~p. EUR~79.95/net; SFR~131.00; \sterling~61.50; \$~99.00 (2007).
13
The complexity of mean flow time scheduling problems with release times. (English)
Comput. Res. Repos. 2006, Article No. 0605078 (2006).
14
Complex scheduling. (English)
GOR-Publications. Berlin: Springer (ISBN 978-3-540-29545-7/hbk). x, 284~p. EUR~84.95/net; SFR~141.00; \sterling~67.99; \$~129.00 (2006).
15
Cyclic scheduling problems with linear precedences and resource constraints. (English)
Haasis, Hans-Dietrich (ed.) et al., Operations research proceedings 2005. Selected papers of the annual international conference of the German Operations Research Society (GOR), Bremen, Germany, September 7‒9, 2005. Berlin: Springer (ISBN 3-540-32537-9/pbk). 667-672 (2006).
16
Scheduling equal processing time jobs to minimize the weighted number of late jobs. (English)
J. Math. Model. Algorithms 5, No. 2, 143-165 (2006).
17
Job-shop scheduling with limited capacity buffers. (English)
OR Spectrum 28, No. 2, 151-176 (2006).
18
Scheduling chains with identical jobs and constant delays on a single machine. (English)
Math. Methods Oper. Res. 63, No. 1, 63-75 (2006).
19
Scheduling equal processing time jobs to minimize the weighted number of late jobs (English)
J. Math. Model. Algorithms 5, No. 2, 143-165 (2006).
20
Result 1 to 20 of 121 total
Start
Contact
Print
General Help
