Results 261 to 270 of about 15,892,718 (300)
Some of the next articles are maybe not open access.
A Note on Open Shop Preemptive Schedules
IEEE Transactions on Computers, 1979The problem of preemptively scheduling a set of n independent jobs on an m processor open shop is discussed. An algorithm to construct preemptive schedules with minimum-maximum finishing time is presented. The worst case time complexity is 0(r + min {m4, n4, r2}), where r is the number of nonzero tasks. The maximum number of preemptions introduced is 0(
openaire +2 more sources
On the Stochastic Open Shop Problem
2003We consider the open shop problem with m machines and n jobs and random operation processing times with distributions F ij . There exists a polynomial time algorithm A (based on the compact vector summation technique) constructing a schedule (generally speaking, unfeasible) of the length equal to the maximum machine load for every instance of the ...
openaire +1 more source
Scheduling open shops with parallel machines
Operations Research Letters, 1982The parallel shop and the open shop are two machine environments that have received much attention in the literature of scheduling theory. A common generalization-the open shop with parallel machines-is considered in this paper. Polynomial-time algorithms are presented for obtaining minimum-length preemptive schedules for three cases.
Eugene L. Lawler +2 more
openaire +2 more sources
2019
The formulation of an open shop scheduling problem is the same as for the flow shop problem except that the order of processing tasks comprising one job may be arbitrary.
Jacek Blazewicz +5 more
openaire +1 more source
The formulation of an open shop scheduling problem is the same as for the flow shop problem except that the order of processing tasks comprising one job may be arbitrary.
Jacek Blazewicz +5 more
openaire +1 more source
On the set of solutions of the open shop problem
Annals of Operations Research, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heidemarie Bräsel +3 more
openaire +3 more sources
A new lower bound for the open‐shop problem
Annals of Operations Research, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gueret, Christelle, Prins, Christian
openaire +5 more sources
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM, 1976A linear time algorithm to obtain a minimum finish time schedule for the two-processor open shop together with a polynomial time algorithm to obtain a minimum finish time preemptive schedule for open shops with more than two processors are obtained. It is also shown that the problem of obtaining minimum finish time nonpreemptive schedules when the open
Teofilo F. Gonzalez, Sartaj Sahni
openaire +2 more sources
2008
A bank of machines in parallel is a setting that is important from both a theoretical and a practical point of view. From a theoretical point of view it is a generalization of the single machine, and a special case of the flexible flow shop. From a practical point of view, it is important because the occurrence of resources in parallel is common in the
openaire +1 more source
A bank of machines in parallel is a setting that is important from both a theoretical and a practical point of view. From a theoretical point of view it is a generalization of the single machine, and a special case of the flexible flow shop. From a practical point of view, it is important because the occurrence of resources in parallel is common in the
openaire +1 more source