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...

This paper describes a simple algorithm for the solution of very large sequence problems without the use of a computer. It produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time. Up to m - 1...

This paper is concerned with the study of the constant due-date assignment policy in a dynamic job shop. Assuming that production times are randomly distributed, each job has a penalty cost that is some non-linear function of its due-date and its actual completion time. The due date is found by...

Presents a dynamic programming model for studying the effects of automation acquisition on the value, cost, and quality control processes in an aggregate single product environment. The model provides the optimal automation acquisition policy, that is the optimal amount of automation to be...

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...