A repairing technique for the local search of the job-shop problem

European Journal of Operational Research

Volumn 153, Issue 1, 2004, Pages 220-238

  Murovec, Boštjan ^a   Šuhel, Peter ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Job shop; Local search; Neighborhood function; Scheduling

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; JOB ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

JOB-SHOP; LOCAL SEARCH; NEIGHBORHOOD FUNCTION;

OPERATIONS RESEARCH;

EID: 0142126265     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00733-6     Document Type: Conference Paper

References (23)

1. Balas E. Machine scheduling via disjunctive graphs: An implicit enumeration algorithm. Operations Research. 17:1969;941-957.
2. Balas E., Vazacopoulos A. Guided local search with shifting bottleneck for job shop scheduling. Management Science. 44(2):1998;262-275.
3. Bierwirth C. A generalized permutation approach to job-shop sceduling with genetic algorithms. OR Spektrum. 17(2-3):1995;87-92.
4. Błazewicz J., Domschke W., Pesch E. The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research. 93(1):1996;1-33.
5. Brucker P., Jurisch B., Sievers B. A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics. 49:1994;109-127.
6. Cheng R., Gen M., Tsujimura Y. A tutorial survey of job-shop scheduling problems using genetic algorithms - i. Representation. Computers and Industrial Engineering. 30(4):1996;983-997.
7. Cheng R., Gen M., Tsujimura Y. A tutorial survey of job-shop scheduling problems using genetic algorithms. Part II. Hybrid genetic search strategies. Computers and Industrial Engineering. 37:1999;51-55.
8. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1997;The MIT Press, Cambridge, Massachusetts London, England.
9. Dell'Amico M., Trubian M. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research. 41:1993;231-252.
10. Gen M., Cheng R. Genetic Algorithms and Engineering Design. 1997;John Wiley & Sons, New York, USA.
11. Glover F. Tabu search - Part I. ORSA Journal on Computing. 1(3):1989;190-206.
12. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning. 1989;Addison-Wesley, USA.
13. Grefenstette J.J. Incorporating problem specific knowledge into genetic algorithms. Davis L. Genetic Algorithms and Simulated Annealing. 1987;42-60 Pitman Publishing, London.
14. Jain A.S., Meeran S. Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research. 113:1999;390-434.
15. Mastrolilli M., Gambardella L.M. Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling. 3:2000;3-20.
16. Matsuo, H., Suh, C.J., Sullivan, R.S., 1988. A controlled search simulated annealing method for the general jobshop scheduling problem. Tech. rep., Department of Management, Graduate School of Business, The University of Texas at Austin, Austin, TX 78712.
17. Mattfeld D.C. Evolutionary Search and the Job Shop: Investigations on Genetic Algorithms for Production Scheduling. 1996;Physica-Verlag, Heidelberg, Germany.
18. Moscato, P., 1989. On evolution, search, optimization, genetic algorithms and martial arts: Toward memetic algorithms. Tech. rep., C3P Report 826, Caltech Concurrent Computation Program, Caltech, California, USA.
19. Nowicki E., Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Science. 42:1996;797-813.
20. Roy, B., Sussmann, B., 1964. Les problèmes d'ordonnancement avec contraintes disjonctives. Note D.S. no. 9 bis, SEMA, Paris, France, Décembre.
21. Vaessens, R.J.M., 1995. Generalized job shop scheduling: Complexity and local search. Ph.D. thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
22. Vaessens R.J.M., Aarts E.H.L., Lenstra J.K. Job shop scheduling by local search. Informs Journal on Computing. 8:1996;302-317.
23. 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.