Results 251 to 260 of about 1,045,429 (295)

Scheduling ordered open shops

Computers & Operations Research, 1987
This paper examines special cases of the open shop problem in an attempt to define the boundary between easy and apparently hard, i.e. NP- complete, problems. The top result is: the minimizing makespan in an ordered three-machine open shop is NP-complete. This implies that many other open shop problems are also NP-complete.
Chang-yung Liu, Robert L. Bulfin Jr.
openaire   +2 more sources

Open shops with jobs overlap––revisited

European Journal of Operational Research, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo, Chelliah Sriskandarajah   +3 more
openaire   +2 more sources

Fighting the Open Shop

2022
Workers resisted precarity by attempting to make Miami a union town. Unionization efforts largely succeeded in the construction sector and other skilled trades. This organizing expanded during WWI to include such areas as street-car operation and retail work.
openaire   +1 more source

An economic analysis of opening hours for shops

Journal of Retailing and Consumer Services, 1998
Abstract This paper provides an economic analysis of the choice of opening hours by shops. We consider a market with heterogeneous profit maximizing firms. The products supplied by these firms are considered as a differentiated product with opening hours as one of the distinguishing characteristics.
Rouwendal, J., Rietveld, P.
openaire   +3 more sources

Flow Shops, Job Shops and Open Shops (Stochastic)

2008
The results for stochastic flow shops, job shops, and open shops are somewhat less extensive than those for their deterministic counterparts.
openaire   +1 more source

On the Stochastic Open Shop Problem

2003
We 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

Efficient Scheduling in Open Shops

1996
A new class of polynomially solvable problems within the class of open shop problems is explored. For the problems with \(m\) machines and \(n\) jobs, an optimal schedule is constructed by an algorithm with polynomial running time in \(m\) and \(n\) when there exists a machine, call it \(i'\), whose load \(l_{i'}\) exceeds the load of any other machine
openaire   +2 more sources

On the set of solutions of the open shop problem

Annals of Operations Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius   +3 more
openaire   +2 more sources

A Note on Open Shop Preemptive Schedules

IEEE Transactions on Computers, 1979
The 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   +1 more source

Scheduling open shops with parallel machines

Operations Research Letters, 1982
The 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, Michael George Luby, Vijay V. Vazirani   +2 more
openaire   +1 more source