Comparative study of dispatching rules in a real-life job shop environment

Applied Artificial Intelligence

Volumn 20, Issue 7, 2006, Pages 585-607

  Mizrak, Pinar ^a   Bayhan, G Mirac ^a  

^a DOKUZ EYLUL UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; PERFORMANCE; SCHEDULING;

BOTTLENECK DYNAMICS; JOB SHOP ENVIRONMENTS; MULTI FACTOR RULE; WEIGHTED TARDINESS;

KNOWLEDGE BASED SYSTEMS;

EID: 33747889825     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/08839510600779738     Document Type: Article

References (18)

1. Baker, K. R. 1998. Elements of Sequencing and Scheduling. USA: Kenneth R. Baker.
2. Boran, M. 2000. Analysis of scheduling heuristics with priority dispatching rules in a real life flexible job shop. MSc. thesis, Dokuz Eylul University Industrial Engineering Department.
3. Carrol, D. C. 1965. Heuristic sequencing of jobs with single and multiple components. PhD thesis, Sloan School of Management, Massachusetts Institute of Tecnology.
4. Chen, S. G. and L. Lin. 1999. Reducing total tardiness cost in manufacturing cell scheduling by a multifactor priority rule. International Journal of Production Research 37:2939-2956.
5. Demirkol, E., S. Mehta, and R. Uzsoy. 1997. A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics 3:111-137.
6. Holthaus, D. and C. Rajendran. 1997. Efficient dispatching rules for scheduling in a job shop. International Journal of Production Economics 48:87-105.
7. Ivens, P. and M. Lambrecht. 1996. Extending the shifting bottleneck procedure to real life applications. European Journal of Operational Research 90:252-268.
8. Jayamohan, M. S. and C. Rajendran. 2000. New dispatching rules for shop scheduling: A step forward. International Journal of Production Research 38:563-586.
9. Jensen, J. B., P. R. Philipoom, and M. K. Malhotra. 1995. Technical note: Evaluation of scheduling rules with commensurate customer priorities in job shops. Journal of Operations Management 13:213-228.
10. Lawrence, S. R. and T. E. Morton. 1993. Resource-constrained multi project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics. European Journal of Operational Research 64:168-197.
11. Liu K. C. 1998. Dispatching rules for stochastic finite capacity scheduling. Computers and Engineering 35:113-116.
12. Morton, T. E. and Pentico, D. 1993. Heuristic Scheduling Systems with Applications to Production and Project Management. New York: John Willey and Sons.
13. Russel, R. S., E. M. Dar-el, and B. W. Taylor. 1987. A comparative analysis of the COVERT job sequencing rule using various shop performance measures. International Journal of Production Research 25:2287-2305.
14. Sabuncuoglu, I. and M. Bayiz. 2000. Analysis of reactive scheduling problems in a job shop environment. International Journal of Operational Research 126:567-586.
15. Sarper, H. and M. C. Henry. 1996. Combinatorial evaluation of six dispatching rules in a dynamic two-machine How shop. International Journal of Management Science, 24:73-81.
16. Subramaniam, V., G. K. Lee, T. Ramesh, G. S. Hong, and Y. S. Wong. 2000. Machine selection rules in a dynamic job shop. International Journal of Advanced Manufacturing Technology 16:902-908.
17. Tsai, D. M. and H. N. Chiu. 1996. Two heuristics for scheduling multiple projects with resource constraints. Construction Management and Economics 14:325-340.
18. Vepsalainen, A. P. J. and T. E. Morton. 1987. Priority rules for job shops with weighted tardiness costs. Management Science 33(8):1035-1047.