We consider the two-machine no-wait open shop minimum makespan problem in which the determination of an optimal solution requires an optimal pairing of the jobs followed by the optimal sequencing of the job pairs. We show that the required enumeration can be curtailed by reducing the pair...

We consider the ordinary NP- hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. We present an O(n2) algorithm for the problem when the machines are ordered, that is, when each job has its smaller...

We first consider the ordinary NP-hard three-machine proportionate open shop minimum makespan O3|prpt|Cmax  problem and show that it is solvable in O(nlog n) time when certain conditions on the total machine load are met. When these conditions are not met, we derive an approximate solution...

We review the latest theoretical developments for the single-machine total tardiness scheduling problem and propose extensions to some of them. We also review (and in some cases extend) exact algorithms, fully polynomial time approximation schemes, heuristic algorithms, special cases and...