We study the early work scheduling problem on identical parallel machines in order to maximize total work, i.e., parts of non-preemptive jobs that are executed before a common due date. By preprocessing and constructing an auxiliary instance which has several good properties, for any desired accuracy $$\varepsilon $$ , we propose efficient polynomial time approximation scheme with running $$O\l...

A new meta-heuristic for scheduling multiple jobs on a single machine so that they are completed by a common specified date (neither earlier, nor later) is addressed in this paper. Costs are set depending on whether a job finished before (earliness), or after (tardiness) the specified due date. The objective is to minimize the total weighted earliness and tardiness penalized costs from the spec...

This chapter presents a novel idea for the general case of the Common Due-Date (CDD) scheduling problem. The problem is about scheduling a certain number of jobs on a single or parallel machines where all the jobs possess different processing times but a common due-date. The objective of the problem is to minimize the total penalty incurred due to earliness or tardiness of the job completions. ...

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. Initially, a job scheduling algorithm that obtains an optimal schedule for a given job sequence is presented. This algorithm is used with a job insertion procedure to generate a group of heuristics that differ on the initial job sequencing rule. Computational...

Family scheduling problems are characterized by a setup time structure where setups are only required between jobs from different families. We consider the problem of scheduling job families on parallel machines to minimize weighted deviation about a common due date. Various special cases of this problem have been considered in the literature. This note summarizes known complexity results and i...

This paper considers the problem of linding an optimal schedule and a common due date for a set of jobs, in a static single machine system. The scheduling criterion is the minimization of the weighted sum of earliness and tardiness values. Different weights are considered as the earliness penalty and tardiness penalty, for each job. A branching procedure is presented for finding an optimal solu...