An efficient combination of dispatch rules for job-shop scheduling problem

2005 3rd IEEE International Conference on Industrial Informatics, INDIN

Volumn 2005, Issue , 2005, Pages 484-488

  Kawai, Tatsunobu ^a   Fujimoto, Yasutaka ^a  

^a YOKOHAMA NATIONAL UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; PRODUCTION CONTROL; RESOURCE ALLOCATION; SCHEDULING;

DISPATCH RULES; JOB SHOP SCHEDULING; PRODUCTION SYSTEMS;

INDUSTRIAL MANAGEMENT;

EID: 33845305447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INDIN.2005.1560424     Document Type: Conference Paper

References (6)

1. R. Haupt, "A Survey of Priority Rule-Based Scheduling", OR Spektrum, vol. 11, pp. 3-16 (1989)
2. J. E. Beasley: "OR-Library: Distributing Test Problems by Electronic Mail", J. Opl. Res. Soc, Vol. 41, No. 11, pp. 1069-1072 (1990)
3. S. A. Cook: "The Complexity of Theorem-Proving Procedures", Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151-158 (1971)
4. R. M. Karp: "Reducibility among combinatorial problems", Complexity of Computation (R. E. Miller and J. W. Thacher, Eds.), Plenum Press, pp. 85-104 (1972)
5. S. J. Morton and D. Pentico: "Heuristic Scheduling Systems", Wiley (1993)
6. I. M. Ovacik and R. Uzsoy: "Decomposition Methods for Complex Factory Scheduling Problems", Kluwer Academic Publishers (1997)