Efficient dispatching rules for dynamic job shop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 24, Issue 1-2, 2004, Pages 70-75

  Dominic, P D D ^a   Kaliyamoorthy, S ^b   Kumar, M Saravana ^c  

^a NATIONAL INSTITUTE OF TECHNOLOGY   (India)

^b ALAGAPPA UNIVERSITY   (India)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Combination rules; Computer simulation; Dispatching rules; Dynamic job shop; Flow time; Tardiness

Indexed keywords

COMPUTER SIMULATION; COMPUTER SOFTWARE; INVENTORY CONTROL; JOB ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES;

COMBINATION RULES; DISPATCHING RULES; DYNAMIC JOB SHOP; FLOW TIME;

SCHEDULING;

EID: 4043168553     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. Baker KR (1984) Sequencing rules and due date assignments in a job shop. Manage Sci 30(9): 1093-1103
2. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
3. Blackstone JH, Philips DT, Hogg GL (1982) A state-of-the survey of dispatching rules for manufacturing job shop operations. Int J Prod Res 20:27-45
4. Bergamaschi D, Gigolini R, Perona M, Portioli A (1997) Order review and release strategies in a job shop environment: a review and classification. Int J Prod Res 35(2):399-420
5. Holloway CA, Nelson RT (1973) Alternative formulation of the job shop problem with due dates. Manage Sci 20(1):65-75
6. Elvers DA (1974) The sensitivity of the relative effectiveness of job shop dispatching rules with respect to various arrival distributions. AUE Trans 6(1):41-49
7. Montgomery DC (1984) Design and analysis of experiments, 2nd edn. Wiley, New York
8. Enns ST (1995) A dynamic forecasting model for job shop flow time prediction and tardiness control. Int J Prod Res 33(5):1295-1312
9. Fishman GS (1971) Estimating sample size in computing simulation experiments. Manage Sci 18:21-38
10. Haupt R (1989) A survey of priority rule-based scheduling. Oper Res Spektrum 11:3-16
11. Holthaus O, Ziegler H (1997) Improving job shop performance by coordinating dispatching rules. Int J Prod Res 35(2):539-549
12. Jones CH (1973) An economic evaluation of job shop dispatching rules. Manage Sci 20(3):293-307
13. Kannan VR, Ghosh S (1993) An evaluation of the interaction between dispatching rules and truncation procedures in job shop scheduling. Int J Prod Res 31(7):1637-1654
14. Holthaus O, Rajendran C (1997) Efficient dispatching rules for scheduling in a job shop. Int J Prod Econ 48:87-105
15. Pierreval H, Mebark N (1997) Dynamic selection of dispatching rules for manufacturing system scheduling. Int J Prod Res 35(6):1575-1591
16. Sim SK, Yeo KT, Lee WH (1994) An expert neural network system for dynamic job shop scheduling. Int J Prod Res 32(8): 1759-1773
17. Sun D, Lin L (1994) A dynamic job shop scheduling framework: a backward approach. Int J Prod Res 32(4):967-985
18. Worrall BM, Mert B (1980) Application of dynamic scheduling rules in maintenance planning and scheduling. Int J Prod Res 18(1):57-71
19. Yih LC, Sullivan RS (1990) Scheduling generation in a dynamic job shop. Int J Prod Res 28(1):65-74