A grasp for job shop scheduling

Operations Research/ Computer Science Interfaces Series

Volumn 15, Issue , 2002, Pages 59-79

  Binato, S ^a   Hery, W J ^b   Loewenstern, D M ^c   Resende, M G C ^d  

^a CEPEL   (Brazil)

^b LUCENT TECHNOLOGIES   (United States)

^c RUTGERS UNIVERSITY   (United States)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84888782799     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4615-1507-4     Document Type: Article

References (41)

1. J. Adams, E. Balas, and D. Zawack. The Shifting Bottleneck Procedurefor Job Shop Scheduling. Management Science, 34:391-401, 1988.
2. R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro. Probability Distributionof Solution Time in GRASP: An Experimental Investigation. To appearin: Journal of Heuristics.
3. D. Applegate and W. Cook. A Computational Study of the Job-ShopScheduling Problem. ORSA Journal on Computing, 3:149-156, 1991.
4. J.F. Bard and T.A. Feo. Operations Sequencing in Discrete Parts Manufacturing. Management Science, 35:249-255, 1989.
5. J.F. Bard, T.A. Feo, and S. Holland. A GRASP for Scheduling PrintedWiring Board Assembly. IIE Transactions, 28:155-165, 1996.
6. J.E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41:1069-1072, 1990.
7. J.L. Bresina. Heuristic-Biased Stochastic Sampling. In: Proceedings of theAAAI-96, pages 271-278, 1996.
8. P. Brucker, B. Jurisch, and B. Sievers. A Branch and Bound Algorithm forthe Job-Shop Scheduling Problem. Discrete Applied Mathematics, 49:105-127, 1994.
9. J. Carlier and E. Pinson. An Algorithm for Solving the Job-Shop Problem. Management Science, 35:164-176, 1989.
10. J. Carlier and E. Pinson. A Practical Use of Jackson's Preemptive Schedulefor Solving the Job-Shop Problem. Annals of Operations Research, 26:269-287, 1990.
11. L. Davis. Job Shop Scheduling with Genetic Algorithms. In: Proceedingsof the First International Conference on Genetic Algorithms and theirApplications, pages 136-140, Morgan Kaufmann, 1985.
12. P. De, J.B. Ghosj, and C.E. Wells. Solving a Generalized Model for ConDue Date Assignment and Sequencing. International Journal of ProductionEconomics, 34: 179-185, 1994.
13. T.A. Feo, J. Bard, and S. Holland. Facility-Wide Planning and Schedulingof Printed Wiring Board Assembly. Operations Research, 43:219-230,1995.
14. T.A. Feo and J.F. Bard. Flight Scheduling and Maintenance Base Planning. Management Science, 35:1415-1432,1989.
15. T.A. Feo and M.G.C. Resende. A Probabilistic Heuristic for a ComputationallyDifficult Set Covering Problem. Operations Research Letters,8:67-71, 1989.
16. T.A. Feo and M.G.C. Resende. Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, 6:109-133, 1995.
17. T.A. Feo, K. Sarathy, and J. McGahan. A GRASP for Single MachineScheduling with Sequence Dependent Setup Costs and Linear Delay Penalties. Computers and Operations Research, 23:881-895, 1996.
18. T.A. Feo, K. Venkatraman, and J.F. Bard. A GRASP for a DifficultSingle Machine Scheduling Problem. Computers and Operations Research,18:635-643, 1991.
19. P. Festa and M.G.C. Resende. GRASP: An Annotated Bibliography. In: Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen, editors,Kluwer, 2001 (this volume).
20. H. Fisher and G.L. Thompson. Probabilistic Learning Combinations ofLocal Job-Shop Scheduling Rules. In: Industrial Scheduling, J.F. Muthand G.L. Thompson, editors, pages 225-251, Prentice Hall, 1963.
21. C. Fleurent and F. Glover. Improved Constructive Multistart Strategies forthe Quadratic Assignment Problem using Adaptive Memory. INFORMSJournal on Computing, 11:198-204, 1999.
22. S. French. Sequencing and Scheduling: An Introduction to the Mathematicsof the Job-Shop. Horwood, 1982.
23. B. GifRer and G.L. Thompson. Algorithms for Solving Production SchedulingProblems. Operations Research, 8:487-503, 1960.
24. F. Glover and M. Laguna. Tabu Search. In: Modern Heuristic Techniquesfor Combinatorial Problems, C.R. Reeves, editor, pages 70-141. Blackwell,1993.
25. A.S. Jain and S. Meeran. A State-of-the-Art Review of Job-Shop SchedulingTechniques. Technical report, Department of Applied Physics, Electronicand Mechanical Engineering, University of Dundee, 1998.
26. M. Laguna and J.L. Gonzalez-Velarde. A Search Heuristic for Just-in-TimeScheduling in Parallel Machines. Journal of Intelligent Manufacturing,2:253-260, 1991.
27. M. Laguna and R. Marti. GRASP and Path Relinking for 2-Layer StraightLine Crossing Minimization. INFORMS Journal on Computing, 11:44-52,1999.
28. J.K. Lenstra and A.H.G. Rinnooy Kan. Computational Complexity ofDiscrete Optimization Problems. Annals of Discrete Mathematics, 4:121-140,1979.
29. H. Ramalhinho Lourenco, J.P. Paixao, and R. Portugal. Metaheuristicsfor the Bus-Driver Scheduling Problem. Technical report, Department ofEconomics and Management, Universitat Pompeu Fabra, Barcelona, 1998.
30. H.R. Lourenco. Local Optimization and the Job-Shop Scheduling Problem. European Journal of Operational Research, 83:347-364, 1995.
31. H.R. Lourenco and M. Zwijnenburg. Combining the Large-Step Optimizationwith Tabu-Search: Application to the Job-Shop Scheduling Problem.In: Meta-Heuristics: Theory and Applications, I.H. Osman and J.P. Kelly,editors, pages 219-236, Kluwer, 1996.
32. E. Nowicki and C. Smutnicki. A Fast Taboo Search Algorithm for the JobShop Problem. Management Science, 42:797-813, 1996.
33. E. Pinson. The Job Shop Scheduling Problem: A Concise Survey andSome Recent Developments. In: Scheduling Theory and its Application, P. Chretienne, E.G. Coffman Jr., J.K. Lenstra, and Z. Liu, editors, pages 277-293, Wiley, 1995.
34. M. Prais and C.C. Ribeiro. Reactive GRASP: An application to a MatrixDecomposition Problem in TDMA Traffic Assignment. INFORMS Journalon Computing, 12:164-176,2000.
35. R.Z. Rios-Mercado and J.F. Bard. Heuristics for the Flow Line Problemwith Setup Costs. European Journal of Operational Research, pages 76-98,1998.
36. R.Z. Rios-Mercado and J.F. Bard. An Enhanced TSP-Based Heuristicfor Makespan Minimization in a Flow Shop with Setup Costs. Journal ofHeuristics, 5:57-74, 1999.
37. B. Roy and B. Sussmann. Les problemes d'ordonnancement avec contraintesdisjonctives. SEMA Note D.S., n. 9, Paris, 1964.
38. E.D. Taillard. Parallel Taboo Search Techniques for the Job Shop SchedulingProblem. ORSA Journal on Computing, 6:108-117, 1994.
39. R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra. Job Shop Scheduling byLocal Search. INFORMS Journal on Computing, 8:302-317, 1996.
40. P.J.M. Van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job Shop Schedulingby Simulated Annealing. Operations Research, 40:113-125, 1992.
41. J. Xu and S. Chiu. Effective Heuristic Procedure for a Field TechnicianScheduling Problem. Technical report, US WEST Advanced Technologies,1998.