An application of tabu search algorithm on cost-based job shop problem with multiple objectives

IEEM 2007: 2007 IEEE International Conference on Industrial Engineering and Engineering Management

Volumn , Issue , 2007, Pages 912-916

  Zhu, Z C ^a   Ng, K M ^a   Ong, H L ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Job shop problem; Multiple objectives; Tabu search algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING;

JOB SHOP PROBLEM; MULTIPLE OBJECTIVES;

TABU SEARCH;

EID: 40649101008     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IEEM.2007.4419324     Document Type: Conference Paper

References (13)

1. K. Bubbul. P. Kaminsky, and C. Yano, "Flow shop scheduling with earliness. tardiness, and intermediate inventory holding costs," Naval Research Logistics, vol. 51, no. 3, pp. 407-445, 2004.
2. M. S. Jayamohan and C. Rajendran, "New dispatching rules for shop scheduling: A step forward," International Journal of Production Research, vol. 38, pp. 563-586, 2000.
3. H. Z. C. Rajendran, "Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence dependent setup times," European Journal of Operation Research, vol. 149, pp. 513-522, 2003.
4. J. Carlier and E. Pinson, "An algorithm for solving the job-shop problem," Management Science, vol. 35, no. 2, pp. 164-176, 1989.
5. A. H. K. R. Kan, Machine scheduling problems: classification, complexity and computations. Martinus nijhoff, 1976.
6. M. Gendreau, Handbook of Meta-heuristics. Boston: Kluwer Academic Publishers, 2003.
7. J. Adams, E. Balas, and D. Zawack, "The shifting bottleneck procedure for job shop scheduling," Management Science, vol. 34, no. 3, pp. 391-401, 1988.
8. E. D. Taillard, "Parallel taboo search techniques for the job shop scheduling problem," ORSA Journal on Computing, vol. 6, no. 2, pp. 108-117, 1994.
9. R. W. Cheng, M. Gen, and Y. Tsujimura, "A tutorial survey of job shop scheduling problems using genetic algorithm-i. representation," Computers Industrial Engineering, vol. 30, no. 4, pp. 983-997, 1996.
10. S. Zolfaghari and M. Liang, "Jointly solving the group scheduling and machining speed selection problems: a hybrid tabu search and simulated annealing approach," International Journal of Production Research, vol. 37, no. 10, pp. 2377-2397, 1999.
11. F. Glover, "Tabu search-part i," ORSA Journal on Computing, vol. 1, pp. 193-200, 1989.
12. R. J. M. Vaessens, E. H. L. Aarts, and J. K. Lenstra, "Job shop scheduling by local search," INFORMS Journal of Computing, vol. 8. pp. 302-317, 1996.
13. C. N. Fiechter, "A parallel tabu search algorithm for large traveling salesman problems," Discrete Applied Mathematics, vol. 51, pp. 243-267, 1994.