International Conference An Algrorithm for Job Shop Scheduling Problem with Due Date Constraints Considering Operation Subcontract
2015.07.30 17:21
| author | Daeyoung Chung |
|---|---|
| 2nd author | / Kichang Lee (Presenter) (Dept. of Industrial Engineering, Seoul National University) / Kitae Shin (Dept. of Industrial Engineering, Seoul National University) / Jinwoo Park (Dept. of Industrial Engineering, Seoul National University) |
| presenter | |
| info | Date: 2000년 08월 02일 ~ 2000년 08월 04일 City: Bangkok Nation: Thailand Additional Information: |
| year | 2000 |
| category | IC |
| start / end date | |
| city / nation | |
| 학회 | ICPR |
| keywords | Job Shop, Scheduling, Due Date |
| abstract | We consider a kind of job shop scheduling problem where each job has its due date. Temporal adjustment of machine capacities is possible through outsourcing with subcontractors when the due dates cannot be kept. In practice, outsourcing of operations is not rare in many types of manufacturing industries. e.g. machining, printing, etc. And practice of outsourcing will increase in accordance, with the emerging new manufacturing paradigms, such as virtual or holonic manufacturing. We present a heuristic solution procedure that addresses the total job-shop scheduling problem by solving a series of smaller sub-problems to optimality. For the sake of efficiency,the algorithm repeatedly executes in two steps on bottleneck machines-(1)improving the sequence of operations and (2) picking out the operations to be subcontracted. Experimental results prove that the suggested algorithm outperforms traditional methods. |
Download:
