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

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.

KEYWORDS:

• Mathematical programming
• just-in-time scheduling
• single machine
• preemption
• release date

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Notes on contributors

Javad Rezaeian

Keyvan Shokoufi received the BSc and the MSc degrees in industrial engineering from Mazandaran University of Science and Technology, Iran, in 2011 and 2015, respectively. He has been working in both industry, in the planning field and academia, as a research assistant since 2013.

Javad Rezaeian is currently an associate professor in the department of industrial engineering at Mazandaran University of Science and Technology, Iran.