Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches

European Journal of Operational Research

Volumn 167, Issue 2, 2005, Pages 336-348

  Zoghby, Jeriad ^a,b   Wesley Barnes, J ^a   Hasenbein, John J ^a  

^a The University of Texas at Austin   (United States)

^b NONE   (United States)

Author keywords

Flexible manufacturing systems; Graph theory; Manufacturing; Metaheuristics; Scheduling

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FLEXIBLE MANUFACTURING SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; MANUFACTURE; MATHEMATICAL MODELS; PROBLEM SOLVING;

ITERATIVE SEARCH TECHNIQUES; JOB SHOP SCHEDULING; METAHEURISTICS; SEQUENCE DEPENDENT SETUPS;

SCHEDULING;

EID: 13544255396     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.03.027     Document Type: Article

References (39)

1. Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job-shop scheduling. Management Science. 34:1988;391-401
2. Baker K. Elements of Sequencing and Scheduling. 1997;Kenneth R Baker, Hanover
3. Balas E. Machine sequencing via disjunctive graphs: An implicit enumeration approach. Operations Research. 17:1969;941-957
4. Balas E., Lenstra J.K., Vazacopoulos A. The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Management Science. 41:1995;94-109
5. J.W. Barnes, M. Laguna, A review and synthesis of tabu search applications to production scheduling problems, Technical Report ORP91-05, The University of Texas, Austin, July 1991
6. Barnes J.W., Laguna M. Solving the multiple-machine weighted flow time problem using tabu search. IIE Transactions. 25:1993;121-128
7. Battiti R.a.G.T. The reactive tabu search. ORSA Journal on Computing. 6:1994;126-139
8. Bierwirth C., Mattfeld D.C. Production scheduling and rescheduling with genetic algorithms. Evolutionary Computation. 7:1999;1-17
9. Blackstone J., Phillips D., Hogg G. A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research. 20:1982;27-45
10. Brucker P., Thiele O. A branch and bound method for the general-shop problem with sequence dependent setup-times. OR Spektrum. 18:1996;145-161
11. S. Cavalieri, F. Crisafulli, O. Mirabella, A genetic algorithm for job-shop scheduling in a semiconductor manufacturing system, presented at IECON Proceedings of the Industrial Electronics Society, San Jose, CA, 1999
12. J. Chambers, Classical and flexible job shop scheduling by tabu search, PhD Thesis, The University of Texas, Austin, 1996
13. J. Chambers, J.W. Barnes, Reactive search for flexible job shop scheduling, Technical Report ORP98-04, The University of Texas, Austin, October 1998
14. Chartrand G., Oellermann O. Applied and Algorithmic Graph Theory. 1993;McGraw-Hill, New York
15. Cheng T., Gupta J., Wang G. A review of flowshop scheduling research with setup times. Production and Operations Management. 9:2000;262-282
16. Dauzere-Peres S., Lasserre J.B. A modified shifting bottleneck procedure for job-shop scheduling. International Journal of Production Research. 31:1993;923-932
17. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP Completeness. 1979;W.H. Freeman, San Francisco
18. Glover F., Laguna M. Tabu Search. 1997;Kluwer Academic Publishers, Boston
19. Goldratt E.M. The Goal: A Process of Ongoing Improvement. 1986;North River Press, Great Barrington, MA
20. Goldratt E.M. Computerized shop floor scheduling. International Journal of Production Research. 26:1988;443-455
21. Herrmann J.W., Lee C.-Y., Hinchman J. Global job shop scheduling with a genetic algorithm. Production and Operations Management. 4:1995;30-45
22. Ivens P., Lambrecht M. Extending the shifting bottleneck procedure to real-life applications. European Journal of Operational Research. 90:1996;252-268
23. Jungnickel D. Graphs, Networks, and Algorithms. vol. 5:1989;Springer, Berlin
24. Kumar N.S.H., Srinivasan G. A genetic algorithm for job shop scheduling - A case study. Computers in Industry. 31:1996;155-160
25. Laguna M., Barnes J.W., Glover F. Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times. Journal of Applied Intelligence. 3:1993;159-172
26. Lawler E.L. Combinatorial Optimization: Networks and Matroids. 1976;Holt, Rinehart and Winston, New York
27. R.C. Leachman, Production planning and scheduling practices across the semiconductor industry, Technical Report 94092559A-XFR, Sematech, Austin, March 2, 1995
28. Lozinski C., Glassey C.R. Bottleneck starvation indicators for shop floor control. IEEE Transactions on Semiconductor Manufacturing. 1:1988;147-153
29. Lu S.C.H., Ramaswamy D., Kumar P.R. Efficient scheduling policies to reduce mean and variance of cycle time in semiconductor manufacturing plants. IEEE Transactions on Semiconductor Manufacturing. 7:1994;374-388
30. Lu S.H., Kumar P.R. Distributed scheduling based on due dates and buffer priorities. IEEE Transactions on Automatic Control. 36:1991;1406-1416
31. K. Nose, A. Hiramatsu, M. Konishi, Using genetic algorithm for job-shop scheduling problems with reentrant product flows, presented at Proceedings of Emerging Technologies and Factory Automation, Barcelona, Spain, 1999
32. Ovacik I.M., Uzsoy R. Decomposition Methods for Complex Factory Scheduling Problems. 1997;Kluwer, West Lafayette, IN
33. Panwalkar S., Iskander W. A survey of scheduling rules. Operations Research. 25:1977;45-61
34. B. Roy, B. Sussman, Les problèmes d'ordonnancement avec contraintes disjonctives, presented at Proceedings of SEMA, Montrouge, 1964
35. J.M.J. Schutten, Shop floor scheduling with setup times: Efficiency versus leadtime performance, PhD Thesis, The University of Twente, Enschede, 1996
36. F. Tiozzo, Building a decision support system for operations scheduling in a large industrial department: A preliminary algorithmic study, Internal Report, University of Udine, Udine, Italy, 1988
37. White K.P., Rogers R.V. Job-shop scheduling: Limits of the binary disjunctive formulation. International Journal of Production Research. 28:1990;2187-2200
38. Zant P.V. Microchip Fabrication - A Practical Guide to Semiconductor Processing. 3rd ed.:1997;McGraw-Hill, New York
39. J. Zoghby, Critical arc strategies for the reentrant job shop scheduling problem with setups, PhD Thesis, University of Texas, Austin, 2002