Results 251 to 260 of about 15,892,718 (300)
Some of the next articles are maybe not open access.
European Journal of Operational Research, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jarosław Pempera, Czesław Smutnicki
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jarosław Pempera, Czesław Smutnicki
exaly +3 more sources
An Algorithm for the Open-Shop Problem
Mathematics of Operations Research, 1983The open-shop problem is known to be NP-complete. However we give an algorithm, which solves the problem in polynomial time, whenever the sum of execution times for one processor is large enough with respect to the maximal execution time. According to the schedule given by our algorithm one of the processors works without idle time.
exaly +2 more sources
Chromatic scheduling in a cyclic open shop
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marek Kubale
exaly +4 more sources
On the complexity of proportionate open shop and job shop problems
Optimization Letters, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdennour Azerine +2 more
openaire +3 more sources
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
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, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joseph Y.-T. Leung +3 more
openaire +3 more sources
An economic analysis of opening hours for shops
Journal of Retailing and Consumer Services, 1998Abstract 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)
2008The results for stochastic flow shops, job shops, and open shops are somewhat less extensive than those for their deterministic counterparts.
openaire +1 more source
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
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
Efficient Scheduling in Open Shops
1996A 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