Research
CATEGORY
International Journal A Batch Splitting Heuristic for Dynamic Job Shop Scheduling Problem
2015.07.29 19:21
| author | Hanil Jeong |
|---|---|
| 2nd author | /Sangbok Woo (Dept. of Industrial Engineering, Seoul National University) / Sukho Kang (Dept. of Industrial Engineering, Seoul National University) / Jinwoo Park (Dept. of Industrial Engineering, Seoul National University) |
| info | Computers & Industrial Engineering (SCIE, 1.057), Vol. 33, No. 3, pp.781-784, 1997 |
| year | 1997 |
| c | IJ |
| 저널/학회 | C&IE |
| group | SCIE |
| keyword | Batch Splitting, Jpb Shop, Scheduling |
| 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 |