Just-In-Time Preemptive Problem with EarlinessTardiness Penalties and Identical Parallel Machines

This paper presents a new mathematical model for an identical parallel-machines scheduling problem with preemptive jobs in a just-in-time (JIT) environment that minimizes earliness and tardiness penalties. 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 , Identical parallel machines