Optimizing the Earliness and Tardiness Penalties in the Single-machine Scheduling Problems with Focus on the Just in Time

Abstract

The single-machine scheduling problem is the basis of scheduling theories. Because some of the production activities are completed earlier or later than standard time, they create several earliness and tardiness penalties. On the other hand, it is necessary to consider just in time philosophy and its importance in the scheduling problems. Therefore, this study seeks to develop a goal function for optimizing single-machine scheduling problems that combines both earliness and tardiness penalties. This study also is determined to minimize the earliness and tardiness penalties in this area. The restricted due date also has multiple effects on the optimum time. This is why that the present study also was aimed to examine the singlemachine scheduling problems with focus on the earliness and tardiness penalties that considering restricted due date simultaneously. The proposed model of this study is an efficient method for understanding the importance of just in time in the scheduling problems.