A decomposition scheme for single stage scheduling problems

Journal of Scheduling

Volumn 13, Issue 3, 2010, Pages 203-212

  Bock, Stefan ^a   Pinedo, Michael ^b  

^a UNIVERSITY OF WUPPERTAL   (Germany)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Single stage scheduling; Speeding up scheduling algorithms; Universal decomposition scheme

Indexed keywords

COMPLETION TIME; DECOMPOSITION SCHEME; NEW APPROACHES; NON-PREEMPTIVE; NP-HARD PROBLEM; OBJECTIVE FUNCTIONS; PROBLEM SIZE; PROCESSING TIME; RELEASE DATE; SCHEDULE LENGTH; SCHEDULING PROBLEM; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE STAGE; SINGLE STAGE SCHEDULING; SOLUTION APPROACH; SPEEDING UP SCHEDULING ALGORITHMS; UNIVERSAL DECOMPOSITION SCHEME;

HIGHWAY ACCIDENTS; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

EID: 77955927711     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-010-0165-1     Document Type: Article

References (20)

1. P. Baptiste 1999 Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing time Journal of Scheduling 2 245 252 10.1002/(SICI)1099-1425(199911/12)2:6<245::AID- JOS28>3.0.CO;2-5
2. P. Baptiste 2000 Scheduling equal-length jobs on identical parallel machines Discrete Applied Mathematics 103 21 32 10.1016/S0166-218X(99)00238-3
3. Baptiste, P., & Brucker, P. (2004). Scheduling equal processing time jobs. In J. Y-T. Leung (Ed.), Handbook of scheduling-algorithms, models, and performance analysis: 14-1-14-37.
4. P. Baptiste V. Timkovsky 2004 Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time Mathematical Methods of Operations Research (ZOR) 60 145 153
5. P. Baptiste P. Brucker S. Knust V. G. Timkovsky 2004 Ten notes on equal-processing-time scheduling. At the frontier of solvability in polynomial time 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies 2 111 127
6. P. Baptiste M. Chrobak C. Dürr W. Jawor N. Vakhania 2004 Preemptive scheduling of equal-length jobs to maximize weighted throughput Operation Research Letters 32 258 264 10.1016/j.orl.2003.09.004
7. P. Baptiste P. Brucker M. Chrobak C. Dürr S. A. Kravchenko F. Sourd 2007 The complexity of mean flow time scheduling problems with release times Journal of Scheduling 10 139 146 10.1007/s10951-006-0006-4 (Pubitemid 46325889)
8. Bock, S., & Pinedo, M. (2007). A decomposition technique for speeding up single stage scheduling algorithms using parallel machines (Working Paper of the Stern School of Business). New York.
9. Brucker, P., & Kravchenko, S. (2004). Scheduling jobs with equal processing times and time windows on identical parallel machines (Technical Report H257). University of Osnabrück.
10. S. Chand R. Traub R. Uzsoy 1996 Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm Naval Research Logistics 43 709 719 10.1002/(SICI)1520-6750(199608)43:5<709::AID-NAV7>3. 0.CO;2-9
11. S. Chand R. Traub R. Uzsoy 1997 Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates Annals of Operations Research 70 115 125 10.1023/A:1018961818782 (Pubitemid 127429152)
12. M. Chrobak C. Dürr W. Jawor L. Kowalik M. Kurowski 2006 A note on scheduling equal-length jobs to maximize throughput Journal of Scheduling 9 71 73 10.1007/s10951-006-5595-4 (Pubitemid 43063751)
13. Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (2009). Introduction to algorithms (3rd ed.). Cambridge: The MIT Press.
14. J. Du J. Y.-T. Leung 1990 Minimizing total tardiness on one machine is NP-hard Mathematics of Operations Research 15 483 495 10.1287/moor.15.3.483
15. Dürr, C., & Hurand, M. (2006). Finding total unimodularity in optimization problems solved by linear programs. In Proceedings of the 14th annual european symposium on algorithms (ESA) (pp. 315-326).
16. J. K. Lenstra A. H. G. Rinnoy Kan P. Brucker 1977 Complexity of machine scheduling problems Annals of Discrete Mathematics 1 343 362 10.1016/S0167-5060(08)70743-X
17. Kellerer, H. (2004). Minimizing the maximum lateness. In J. Y.-T. Leung (Ed.), Handbook of scheduling-algorithms, models, and performance analysis: 10-1-10-12.
18. Pinedo, M. (2005). Planning and scheduling in manufacturing and services. New York: Springer.
19. Pinedo, M. (2008). Scheduling: theory, algorithms, and systems (3rd ed.). New York: Springer.
20. Scholl, A. (1999). Balancing and sequencing of assembly lines (2nd ed.). New York: Physica.