Abstract
An efficient simulation/optimization approach is presented for finding a dynamic dispatching priority in a static job shop environment under the presence of multiple identical jobs. The key ingredients of the proposed approach are (1) an efficient processing-time-based dispatching rule, (2) simulation of a job shop, and (3) a mechanism to `fake' (or modify) job processing times based on the information of job slack obtained from simulation. The paper presents an overall approach to fake processing times, and also identifies alternative strategies for algorithm design. Experimental results of the proposed approach yield a dispatching priority with more than 10% better due date performance than the priority generated by a good processing-time-based dispatching rule in roughly 20 simulation runs.
| Original language | English |
|---|---|
| Title of host publication | Winter Simulation Conference Proceedings |
| Editors | S. Andradottir, K.J. Healy, D.H. Withers, B.L. Nelson |
| Publisher | IEEE |
| Pages | 872-879 |
| Number of pages | 8 |
| Publication status | Published - 1997 |
| Event | Proceedings of the 1997 Winter Simulation Conference - Atlanta, GA, USA Duration: 1997 Dec 7 → 1997 Dec 10 |
Other
| Other | Proceedings of the 1997 Winter Simulation Conference |
|---|---|
| City | Atlanta, GA, USA |
| Period | 97/12/7 → 97/12/10 |
ASJC Scopus subject areas
- Chemical Health and Safety
- Software
- Safety, Risk, Reliability and Quality
- Applied Mathematics
- Modelling and Simulation