International Conference A batch splitting heuristic for dynamic job shop scheduling problem
2015.07.30 13:27
| author | Hanil Jeong |
|---|---|
| 2nd author | |
| presenter | |
| info | This conference paper has been presented on the International Conference on Computers & Industrial Engineering. The conference has been held in Kyongju, Korea, 1996/10/6 ~ 1996/10/9 . Additional information about the conference(conference paper) is '20th International Conference on Computers & Industrial Engineering, Vol. I 531-534'. |
| year | 1996 |
| category | IC |
| start / end date | |
| city / nation | |
| 학회 | CIE |
| keywords | Job Shop, Scheduling, Batch Splitting Heuristics |
| abstract | The job shop scheduling problem has been a major target for many researchers. Unfortunately, though, most of the past studies assumed that a job consists of only a single part. If we assume that a job consists of a batch as in many real manufacturing environment, then we can obtain an improved schedule. However, then, the size of the scheduling problem would become too large to be solved in practical time limit. So, we proposed an algorithm to get an improved schedule by splitting the original batch into smaller batches, and thereby can meet the due date requirement, and adapt to unexpected dynamic events such as machine failure, rush order and expediting. |
Download :
