An iterative layered tabu search algorithm for complex job shop scheduling problem

Chinese Journal of Electronics

Volumn 14, Issue 3, 2005, Pages 519-523

  Liu, Min ^a   Dong, Mingyu ^a   Wu, Cheng ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Iterative; Job shop; Layered; Parallel machines; Scheduling; Tabu search; Technical constraints; Textile

Indexed keywords

CONSTRAINT THEORY; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; TEXTILES;

ITERATIVE; JOB SHOP; LAYERED; PARALLEL MACHINES; TABU SEARCH; TECHNICAL CONSTRAINTS;

ALGORITHMS;

EID: 21644446428     PISSN: 10224653     EISSN: 20755597     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. J.R. Jackson, "Scheduling a production line to minimize maximum tardiness", Research Report 43, Management Science Research Project, University of California at Los Angeles, 1955.
2. J. Blazewicz, K. Eckeer, "A liner time algorithm for restricted bin packing and scheduling problems", Operations Research Letters, Vol.2, pp.80-83, 1983.
3. P. Brucker, B. Jurisch, B. Sievers, "A branch & bound algorithm for the job-shop scheduling problem", Discrete Applied Mathematics, Vol.49, No.1-3, pp.107-127, 1994.
4. VCS Wiers, "A review of the applicability of OR and AI scheduling techniques in practice", Omega-The International Journal of Management Science, Vol.25, pp.145-153, 1997.
5. W.E. Smith, "Various optimizers for single stage production", Naval Research Logistics Quarterly, Vol.3, pp.59-66, 1956.
6. S. Panwalkar, W. Iskander, "A survey of scheduling rules", Operations Research, Vol.25, No.1, pp.45-64, 1977.
7. Y.P.S. Foo, Y. Takefuji, "Stochastic neural networks for solving job-shop scheduling: Part I. Problem representation", In Proceeding of the IEEE International Conference on Neural Networks, Sandiego, Vol.II, pp.275-282, 1988.
8. Y.P.S. Foo, Y. Takefuji, "Stochastic neural networks for solving job-shop scheduling: Part II. Architecture and simulations", In Proceeding of the IEEE International Conference on Neural Networks, Sandiego, Vol.II, pp.283-290, 1988.
9. F. Glover, "Tabu search-Part I", ORSA Journal on Computing, Vol.1, No.3, pp.190-206, 1989.
10. F. Glover, "Tabu search-Part II", ORSA Journal on Computing, Vol.2, No.1, pp.4-32, 1990.
11. M.G.A. Verhoeven, "Tabu search for resource-constrained scheduling", European Journal of Operational Research, Vol.106, No.2-3, pp.266-276, 1998.
12. A. Hertz, M. Widmer, "An improved tabu search approach for solving the job shop scheduling problem with tooling constraints", Discrete Applied Mathematics, Vol.65, No.1-3, pp.319-345, 1996.
13. M. Dell'Amico, M. Trubian, "Applying tabu search to the job-shop scheduling problem", Annals of Operations Research, Vol.41, No.1-4, pp.231-252, 1993.
14. F. Pezzella, E. Merelli, "A tabu search method guided by shifting bottleneck for the job shop scheduling problem", European Journal of Operational Research, Vol.120, No.2, pp.297-310, 2000.
15. E. Nowicki, C. Smutnicki, "A fast taboo search algorithm for the job shop problem", Management Science, Vol.42, No.6, pp.797-813, 1996.
16. E. Nowicki, C. Smutnicki, "The flow shop with parallel machines: a tabu search approach", European Journal of Operational Research, Vol.106, No.2-3, pp.226-253, 1998.
17. Y.K. Sun, M. Liu, C. Wu, "Tabu search algorithm with varying neighborhood and its application to job shop scheduling problem", Acta Electronica Sinica (in Chinese), Vol.29, No.5, pp.622-625, 2001.
18. S. Lawrence, "Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques", Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, 1984.
19. M. Liu, M.Y. Dong, C. Wu, "An objective decomposing method based on IBMDC for solving complex production scheduling problem", Proceedings of 2002 International Conference on Machine Learning and Cybernetics, Vol.3, pp.1676-1679, 2002.