Preemptive Single-Machine Scheduling Problem in a Just-in-time Environment with Considering Work Load Cost and Earliness-Tardiness Penalties

This paper presents a new mathematical model for a single machine scheduling problem with preemptive jobs in a just-in-time (JIT) environment that minimizes earliness, tardiness penalties and work load cost. In general in non-preemptive problems, earliness/tardiness penalties are a function of the completion time of all the jobs. However, we introduce a preemptive scheduling model where the earliness penalty depends on the start time of a job. To validate and verify the proposed model, we linearize the presented model. Furthermore, a number of numerical examples are solved by LINGO 9.

Keywords:

: Just-in-time , Preemption , Earliness/Tardiness , Single Machine , Dependent Setup Cost