Job-shop scheduling with processing alternatives

European Journal of Operational Research

Volumn 151, Issue 2, 2003, Pages 307-332

  Kis, Tamás ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Genetic algorithms; Insertion techniques; Job shop; Open shop; Scheduling; Tabu search

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; SCHEDULING; SET THEORY;

INSERTION TECHNIQUES;

OPERATIONS RESEARCH;

EID: 0042021869     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00828-7     Document Type: Conference Paper

References (24)

1. Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job-shop scheduling. Management Science. 34:1988;391-401.
2. Blazewicz J., Ecker K.H., Pesch E., Schmidt G., Weglarz J. Scheduling Computer and Manufacturing Processes. second ed. 2001;Springer-Verlag, Berlin.
3. Brandimarte P. Routing and scheduling in a flexible job-shop by tabu search. Annals of Operations Research. 41:1993;157-183.
4. Bräsel H., Tautenhahn T., Werner F. Constructive heuristic algorithms for the open-shop problem. Computing. 51:1993;95-110.
5. Brucker P., Schlie R. Job-shop scheduling with multi-purpose machines. Computing. 45:1990;369-375.
6. Brucker P., Neyer J. Tabu search for the multi-mode job-shop problem. OR-Spektrum. 20:1998;21-28.
7. Brucker P., Hurink J., Jurisch B., Wöstmann B. A branch and bound algorithm for the open-shop problem. Discrete Applied Mathematics. 76:1997;43-59.
8. Coffman E.G. Jr. Computer and Job-Shop Scheduling Theory. 1976;John Wiley & Sons.
9. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1998;MIT Press.
10. J. Detand, A Computer Aided Process Planning System Generating Non-linear Process Plans, PhD Thesis, KU Leuven, Belgium, 1993.
11. Dauzère-Pérès S., Paulli J. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research. 70:1997;281-306.
12. Dauzère-Pérès S., Roux W., Lasserre J.B. Multi-resource shop scheduling with resource flexibility. European Journal of Operational Research. 107:1998;289-305.
13. Dell'Amico M., Trubian M. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research. 41:1993;231-252.
14. Garey M.R., Johnson D.S. Computers and Intractability. 1979;W.H. Freeman.
15. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning. 1989;Addison-Wesley, Reading, MA.
16. Hurink J., Jurisch B., Thole M. Tabu search for the job shop scheduling problem with multi-purpose machines. OR-Spektrum. 15:1994;205-215.
17. B. Jurisch, Scheduling jobs in shops with multi-purpose machines, Dissertation, Fachbereich Mathematik/Informatik, Universität Osnabrück, 1992.
18. Van Laarhoven P.J.M., Aarts E.H.L., Lenstra J.K. Job-shop scheduling by simulated annealing. Operations Research. 40(1):1992;113-125.
19. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics. 4:1977;121-140.
20. Mastrolilli M., Gambardella L.M. Effective neighbourhood for the flexible job-shop problem. Journal of Scheduling. 3(1):2000;3-20.
21. Masuda T., Ishii H., Nishida T. The mixed shop scheduling problem. Discrete Applied Mathematics. 11(2):1985;175-186.
22. Shakhlevich N.V., Sotskov Yu.N., Werner F. Complexity of mixed shop scheduling problems: A survey. European Journal of Operational Research. 120:2000;343-351.
23. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research. 64(2):1993;278-285.
24. Werner F., Winkler A. Insertion techniques for the heuristic solution of the job-shop problem. Discrete Applied Mathematics. 58:1995;191-211.