Minimizing maximum lateness in a twomachine open shop
Abstract
The problem of scheduling independent jobs in a two machine open shop so as to minimize the maximum lateness with respect to due dates for the jobs is considered. Each job consists of two operations, one of length a sub j which is to be executed on machine M sub 1 and one of length b sub j which is to be executed on machine M sub 2. There is no restriction on the order in which the operations of a job are to be performed, hence the term open shop. For the case in which preemption is allowed, a linear time algorithm is presented. For the nonpreemptive case, NPhardness is established.
 Publication:

NASA STI/Recon Technical Report N
 Pub Date:
 September 1979
 Bibcode:
 1979STIN...8029533L
 Keywords:

 Lateness;
 Machining;
 Minima;
 Production Planning;
 Algorithms;
 Consecutive Events;
 Interruption;
 Linear Programming;
 Permutations;
 Polynomials;
 Preempting;
 Scheduling;
 Sequencing;
 Time Dependence;
 Engineering (General)