New local search algorithm for job shop scheduling problem

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 28, Issue 5, 2005, Pages 809-816

  Wang, Lei ^a   Huang, Wen Qi ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Combinational optimization; Job shop scheduling; Local search; NP hard

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; SCHEDULING; THEOREM PROVING;

COMBINATIONAL OPTIMIZATION; COMPLETION TIME; GREEDY STRATEGY; JOB SHOP SCHEDULING; LOCAL SEARCHING; MINIMUM MAKE SPAN PROBLEM; NEIGHBORHOOD STRUCTURE;

JOB ANALYSIS;

EID: 20444394714     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (5)

1. Garey M., Johnson D., Sethy R.. The complexity of flow shop and job shop scheduling. Mathematics of Operations Research. 1976, 1(2): 117-129
2. Carlier J., Pison E.. An algorithm for solving the job-shop problem. Management Science, 1989, 35(2): 164-176
3. Adams J., Balas E., Zawack D.. The shifting bottleneck procedure for job shop scheduling. Management Science, 1988, 34(3): 391-401
4. Balas E., Vazacopoulos A.. Guided local search with shifting bottleneck for job shop scheduling. Management Science, 1998. 44(2): 262-275
5. Pezzella F., Merelli E.. A tabu search method guided by shifting bottleneck for the job shop scheduling problem. European Journal of Operational Research, 2000, 120(2): 297-310