A conflict-based priority dispatching rule and operation-based approaches to job shops
Abstract Job shop scheduling (JSS) problems consist of a set of machines and a collection of jobs to be scheduled. Each job consists of several operations with a specified processing order. In this paper, a job shop model problem is scheduled with the help of the Giffler and Thompson algorithm...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Citation Index Journal |
| 出版: |
springer
2004
|
| 主題: | |
| 在線閱讀: | http://eprints.utp.edu.my/3447/1/IJAMT_2004_dy.pdf http://eprints.utp.edu.my/3447/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|