Multiple-Machine Lower Bounds for Shop-Scheduling Problems

References

• Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science (1988) 34:391–401Link, Google Scholar
• Applegate D., Cook W. A computational study of the jobshop scheduling problem. ORSA J. Computing (1991) 3:149–156Link, Google Scholar
• Baker K.R., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Operations Research (1983) 26:111–120Link, Google Scholar
• Baptiste P., Le Pape C. Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. Proc. 15th Workshop of the U.K. Planning Special Interest Group (1996) (Liverpool, United Kingdom) Google Scholar
• Blazewicz J., Domschke W., Pesch E. The job shop scheduling problem: conventional and new solution techniques. European J. Operational Research (1996) 91:1–33Crossref, Google Scholar
• Brinkkötter W., Brucker P. Solving open benchmark problems for the job shop problem. Technical Report. Osnabrücker Schriften zur Mathematik (1999) (Universität Osnabrück, Osnabrück, Germany) . 212Google Scholar
• Carlier J. The one-machine sequencing problem. European J. Operational Research (1982) 11:42–47Crossref, Google Scholar
• Carlier J., Pinson E. An algorithm for solving the job-shop problem. Management Science (1989) 35:164–176Link, Google Scholar
• Carlier J., Pinson E. A practical use of Jackson's preemptive schedule for solving the job shop problem. Annals of Operations Research (1990) 26:269–287Crossref, Google Scholar
• Carlier J., Pinson E. Adjustment of heads and tails for the job-shop problem. European J. Operational Research (1994) 78:146–161Crossref, Google Scholar
• Fisher H., Thompson G.L., Muth J.F., Thompson G.L. Probabilistic learning combinations of local job-shop scheduling rules. Industrial Scheduling (1963) (Prentice Hall, Englewood Cliffs, NJ) 225–251Google Scholar
• Garey M.R., Johnson D.S., Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research (1976) 1:117–129Link, Google Scholar
• Graham R.E., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics (1979) 4:287–326Crossref, Google Scholar
• Jain A.S., Meeran S. Deterministic job-shop scheduling: past, present and future. European J. Operational Research (1999) 113:390–434Crossref, Google Scholar
• Lawrence S. Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). (1984) (Carnegie Mellon University, Pittsburgh, PA) . Graduate School of Industrial AdministrationGoogle Scholar
• Martin P.D., Shmoys D.B. A new approach to computing optimal schedules for the job shop scheduling problem. Proceedings Fifth International IPCO Conference Vancouver, Canada. Lecture Notes in Computer Science (1996) 1084:389–403Crossref, Google Scholar
• Nuijten W. Time and resource constrained scheduling: a constraint satisfaction approach. (1994) . Ph.D. thesis, Eindhoven University of Technology, Eindhoven, The NetherlandsGoogle Scholar
• Nuijten W., Le Pape C. Constraint-based job shop scheduling with Ilog Sheduler. J. of Heuristics (1998) 3:271–286Crossref, Google Scholar
• Peridy L. Le Problème de job-shop: arbitrage et ajustements. (1996) . Ph.D. thesis, Université de Technologie de Compiègne, Compiègne, FranceGoogle Scholar
• Reeves C.R. A genetic algorithm for flowshop sequencing. Computers and Operations Research (1995) 22:5–13Crossref, Google Scholar
• Roy B., Sussmann B. Les problèmes d'ordonnancement avec contraintes disjonctives. (1964) (SEMA, Paris) . Note DS No. 9 bisGoogle Scholar
• Sourd F. Contributions à l'étude et à la résolution de problè mes d'ordonnancement disjonctif. (2000) . Ph.D. thesis, Université Pierre et Marie Curie, ParisGoogle Scholar
• Sourd F., Nuijten W. Scheduling with tails and deadlines. (1999) . Technical Report 1999-032, LIP6, Université Pierre et Marie Curie, ParisGoogle Scholar
• Yamada T., Nakano R., Männer R., Manderick B. A genetic algorithm applicable to largescale job-shop problems. Proceedings of the 2nd International Workshop on Parallel Problem Solving from Nature (1992) (North-Holland, Amsterdam, The Netherlands) 281–290Google Scholar