An efficient priority rule for scheduling job shops to minimize mean tardiness

IIE Transactions (Institute of Industrial Engineers)

Volumn 38, Issue 9, 2006, Pages 789-795

  Weng, Michael X ^a   Ren, Haiying ^a  

^a University of South Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; JOB ANALYSIS; MARKETING; OPTIMIZATION; SCHEDULING;

JOB SHOPS; MEAN TARDINESS; SHOP LOAD;

OPERATIONS RESEARCH;

EID: 33746145931     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170600710523     Document Type: Review

References (16)

1. Baker, K.(1974) Introduction to Sequencing and Scheduling. New York NY: Wiley.
2. Baker, K. (1984) Sequencing rules and due date assignments in a job shop Management Science, 9, pp. 1093-1104. [CSA]
3. Baker, K. and Bertrand, J. (1982) A dynamic priority rule for sequencing against due-dates Journal of Operations Management, 3, pp. 37-42. [CSA] [CROSSREF]
4. Baker, K. and Dzielinski, B. (1960) Simulation of a simplified job shop Management Science, 6, pp. 311-323. [CSA]
5. Bhaskaran, K. and Pinedo, M. (1992) Dispatching. In Handbook of Industrial Engineering, 2nd edn... New York NY: Wiley.
6. Carroll, D. (1965) Heuristic sequencing of jobs with single and multiple components. Cambridge MA: Sloan School of Management, MIT.
7. Cheng, T. and Gupta, M. (1989) Survey of scheduling research involving due date determination decisions European Journal of Operational Research, 38, pp. 156-166. [CSA] [CROSSREF]
8. Conway, R. and Maxwell, W. and Miller, L. (1967) Theory of Scheduling. Reading MA: Addison-Wesley.
9. Du, J. and Leung, J. (1990) Minimizing total tardiness on one machine is NP-hard Mathematica of Operations Research, 15, pp. 483-495. [CSA]
10. Elvers, D. and Taube, L. (1983) Time completion for various dispatching rules in job shops OMEGA, 11, pp. 81-89. [CSA] [CROSSREF]
11. Kutanoglu, E. and Sabuncuoǧlu, I. (1999) An analysis of heuristics in a dynamic job shop with weighted tardiness objective International Journal of Production Research, 37, pp. 165-187. [CSA] [CROSSREF]
12. Nanot, Y.R. (1963) An experimental investigation and comparative evaluation of priority disciplines in job-shop-like queueing networks. Los Angeles CA: UCLA.
13. Panwalker, S. and Iskander, W. (1977) A survey of scheduling rules Operations Research, 25, pp. 45-61. [CSA]
14. Vepsalainen, A. and Morton, T. (1987) Priority rules for job shops with weighted tardiness costs Management Science, 33, pp. 1035-1047. [CSA]
15. Weng, M. and Lu, J. and Ren, H. (2001) Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective International Journal of Production Economics, 70, pp. 215-226. [CSA] [CROSSREF]
16. Wilbrecht, J. and Prescott, W. (1969) The influence of setup time on job shop performance Management Science, 16, pp. 274-280. [CSA]