An exact solution approach using a novel concept for single machine preemptive scheduling problem in the just-in-time production system

Abstract

ABSTRACT This paper addresses single machine scheduling with preemption, machine idle time and release date to minimize the total weighted Earliness/Tardiness penalties and Work-In-Process (WIP) costs. This research brings a novel concept in the solution approach by introducing a new Mixed Integer Linear Programming (MILP) model which provides a new insight of the studied problem. The proposed MILP model is benchmarked with an existing model in four divisions under 144 randomly numerical problems. In addition, a discussion is made on several features of the introduced approach. The results demonstrate that the new model can easily find optimum solution up to six jobs in small computational times where values of parameters can be discrete or continuous within a wide range of values. While the existing model can find optimum solution up to four jobs in larger computational times where parameters can only take certain values within a small range of values.