A Mix Integer Programming Model for Parallel Machine Scheduling Problem: Using Shared Resource

Abstract

In parallel machine scheduling problems, if jobs have shared resources, it is not possible to schedule these jobs at the same time. For instance, if same mold are used for producing two different plastic parts, one of the parts has to wait until the end of other part’s process. In production systems including parallel machines, in general, jobs use shared resources like mold, crane etc. In this study, an identical parallel machine scheduling problem with shared resources is considered. A mixed-integer programming model is developed for considered problem. The solving performance of proposed model by GAMS/Cplex solver was tested using randomly generated small and large-sized instances

Keywords

• Parallel machine scheduling problem
• Sequence dependent setup time
• Machine eligibility restrictions
• Using shared resources
• Mixed integer programming