We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson’s rule. For...

We analyze the performance of the greedy algorithm for the on-line two-machine open shop scheduling problem of minimizing makespan, in which time lags exist between the completion time of the first and the start time of the second operation of any job. The competitive ratio for the greedy...

Mathematical programming representation has been recently used to describe the behavior of discrete event systems as well as their formal properties. This new way of representing discrete event systems paves the way to the creation of simpler mathematical programming models that reduce the...

In this paper, we propose a tool for testing the quality of heuristic solutions for scheduling problems with a min-max objective function, such as, for example, the minimization of maximum tardiness or makespan. We present a bounding scheme which is powerful enough to allow an accurate quality...