A mathematical model for job shop scheduling with multiple process plan consideration per job |
| |
| Authors: | Kun-Hyung Kim Pius J Egbelu |
| |
| Institution: | 1. Department of Statistics, Faculty of Mathematics and Computer Sciences , Shahid Bahonar University of Kerman , Kerman, Iran parchami@mail.uk.ac.ir;3. Department of Statistics, Faculty of Mathematics and Computer Sciences , Shahid Bahonar University of Kerman , Kerman, Iran;4. Information Technology Department , Shahrood University of Technology , Shahrood, Iran |
| |
| Abstract: | In this paper, a mixed integer programming model is formulated for scheduling a set of jobs through a shop when each job is supplied or provided with multiple process plans or process routings. Simultaneous selection of a process plan for each job and the sequencing of the jobs through the machines in the shop based on the set of selected process plans is addressed. The procedure developed seeks to integrate the selection of machines for each job and the sequencing of jobs on each machine based on the objective of minimizing production makespan. the application of the procedure is demonstrated with an example problem. The following conclusions were drawn as a result of the research: (1) the procedure developed produces optimal or near optimal solution; (2) the benefit from the developed approach is that it allows a shop to adaptively select process plans for jobs to optimize on production makespan. By combining solution quality with scheduling flexibility and efficiency, the productivity of a shop can be greatly enhanced. |
| |
| Keywords: | Process Plan Scheduling Sequencing Production Planning Makespan |
|
|
