Abstract
In this paper we deal with solution algorithms for a general formulation of the job shop problem, called alternative graph. We study in particular the job shop scheduling problem with blocking and/or no-wait constraints. Most of the key properties developed for solving the job shop problem with infinite capacity buffer do not hold in the more general alternative graph model. In this paper we report on an extensive study on the applicability of a metaheuristic approach, called rollout or pilot method. Its basic idea is a look-ahead strategy, guided by one or more subheuristics, called pilot heuristics. Our results indicate that this method is competitive and very promising for solving complex scheduling problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adams, J., E. Balas, and D. Zawack. (1988). “The Shifting Bottleneck Procedure for Job Shop Scheduling.” Management Science 34(3), 391–401.
Applegate, D. and W. Cook. (1991). “A Computational Study of the Job Shop Scheduling Problem.” ORSA Journal on Computing 3(2), 149–156.
Balas, E. (1979). “Disjunctive Programming.” Annals of Discrete Mathematics 5, 3–51.
Balas, E. and A. Vazacopoulos. (1998). “Guided Local Search with Shifting Bottleneck for Job Shop Scheduling.” Management Science 44(2), 262–275.
Bertsekas, D.P. and J.N. Tsitsiklis. (1996). Neuro-Dynamic Programming. Belmont,MA: Athena Scientific.
Bertsekas, D.P., J.N. Tsitsiklis, and C. Wu. (1997). “Rollout Algorithms for Combinatorial Optimization.” Journal of Heuristics 3, 245–262.
Błażewicz, J., W. Domschke, and E. Pesch. (1996). “The Job Shop Scheduling Problem: Conventional and New Solution Techniques.” European Journal of Operational Research 93(1), 1–33.
Carlier, J. and E. Pinson. (1989). “An Algorithm for Solving the Job-Shop Problem.” Management Science 35(2), 164–176.
Carlier, J. and E. Pinson. (1994). “Adjustment of Heads and Tails for the Job-Shop Problem.” European Journal of Operational Research 78, 146–161.
Cassandras, C.G., S. Lafortune, and G.J. Olsder. (1995). “Introduction to the Modelling, Control and Optimization of Discrete Event Systems.” In A. Isidori (ed.), Trends in Control. London: Springer, pp. 217–292.
Dorndorf, U. and E. Pesch. (1995). “Evolution Based Learning in a Job Shop Scheduling Environment.” Computers & Operations Research 22, 25–40.
Duin, C. and S. Voß. (1999). “The Pilot Method: A Strategy for Heuristic Repetition with Application to the Steiner Problem in Graphs.” Networks 34, 181–191.
Fox, M.S. (1983). “Constraint Directed Search: A Case Study of Job Shop Scheduling.” Ph.D. Thesis, Carnagie Mellon University, Pittsburg, PA.
Glover, F. (1986). “Future Paths for Integer Programming and Links to Artifical Intelligence.” Computers & Operations Research 13, 533–549.
Hall, N.J. and C. Sriskandarajah. (1996). “A Survey on Machine Scheduling Problems with Blocking and No-Wait in Process.” Operations Research 44(3), 510–525.
Jain, A.S. and S. Meeran. (1999). “Deterministic Job-Shop Scheduling: Past, Present and Future.” European Journal of Operational Research 113, 390–434.
Lawrence, S. (1984). Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, GSIA, Carnagie Mellon University, Pittsburg, PA.
Lowerre, B.T. (1976). “The HARPY Speech Recognition System.” Ph.D. Thesis, Carnagie Mellon University, Pittsburg, PA.
Mascis, A. and D. Pacciarelli. (2000). “Machine Scheduling via Alternative Graphs.” Report DIA-46-2000, Dipartimento di Informatica e Automazione, Università Roma Tre.
Mascis, A. and D. Pacciarelli. (2002). “Job Shop Scheduling with Blocking and No-Wait Constraints.” European Journal of Operational Research 143(3), 498–517.
Muth, J.F. and G.L. Thompson (eds.). (1963). Industrial Scheduling. Amsterdam: Kluver Academic.
Nowicki, E. and C. Smutnicki. (1996). “A Fast Taboo Search Algorithm for the Job Shop Scheduling Problem.” Management Science 42(6), 797–813.
Nuijten, W. and C. Le Pape. (1998). “Constraint-Based Job Shop Scheduling with Ilog Scheduler.” Journal of Heuristics 3, 271–286.
Ow, P.S. and T.E. Morton. (1988). “Filtered Beam Search in Scheduling.” International Journal of Production Research 26, 297–307.
Pacciarelli, D. (2002). “The Alternative Graph Formulation for Solving Complex Factory Scheduling Problems.” International Journal of Production Research 40(15), 3641–3653.
Pinson, E. (1997). “The Job Shop Scheduling Problem: A Coincise Survey and Some Recent Developments.” In P. Chrétienne, E.G. Coffman, J.K. Lenstra, and Z. Liu (eds.), Scheduling Theory and Its Applications. New York: Wiley, pp. 277–294.
Roy, B. and B. Sussman. (1964). “Les Problèmes D'ordonnancement avec Contraintes Disjonctives.” Note DS No. 9bis, SEMA, Paris.
Sadeh, N., K. Sycara, and Y. Xiong. (1995). “Backtracking Techniques for the Job Shop Scheduling Constraints Satisfaction Problem.” Artificial Intelligence 76, 455–480.
Schutten, J.M.J. (1998). “Practical Job Shop Scheduling.” Annals of Operations Research 83, 161–177.
Vaessens, R.J.M., E.H.L. Aarts, and J.K. Lenstra. (1992). “Job Shop Scheduling by Local Search.” INFORMS Journal on Computing 8(3), 302–317.
Voß, S., S. Martello, I.H. Osman, and C. Roucairol (eds.). (1999). Meta-Heuristics:Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer Academic.
White, K.P. and R.V. Rogers. (1990). “Job-Shop Scheduling: Limits of the Binary Disjunctive Formulation.” International Journal of Production Research 28(12), 2187–2200.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Meloni, C., Pacciarelli, D. & Pranzo, M. A Rollout Metaheuristic for Job Shop Scheduling Problems. Ann Oper Res 131, 215–235 (2004). https://doi.org/10.1023/B:ANOR.0000039520.24932.4b
Issue Date:
DOI: https://doi.org/10.1023/B:ANOR.0000039520.24932.4b