When difference in machine loads leadsto efficient scheduling in open shops

A. Kononov, S. Sevastianov and I. Tchernykh

Annals of Operations Research, 1999, vol. 92, issue 0, 239 pages

Abstract: We consider the open shop problem with n jobs, mmachines, and the minimum makespan criterion. Let l i stand for the loadof the ith machine, l max be the maximum machine load,and p max be the maximum operation length. Suppose that the machines arenumbered in nonincreasing order of their loads and that p max =1, whileother processing times are numbers in the interval [0,1]. Then, given aninstance of the open shop problem, we define its vector of differences $$VOD=\left( {\Delta \left( 1 \right), \ldots ,\Delta \left( m \right)} \right)$$ , where $$\Delta \left( i \right)=l_{\max } - l_i $$ .An instance is called normal if its optimal schedule has length l max .A vector Δ ∈ ℝ m is called normalizing if every instancewith VOD=Δ is normal. A vector Δ ∈ ℝ m is called efficiently normalizing if it is normalizing and there is a polynomial‐timealgorithm which for any instance with VOD=Δ constructs itsoptimal schedule. In this paper, a few nontrivial classes of efficiently normalizingvectors are found in ℝ m . It is also shown that the vector $$\left( {0,0,2} \right)$$ is the unique minimal normalizingvector in ℝ m , and that there are at least two minimal normalizingvectors in ℝ m . Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018986731638 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:92:y:1999:i:0:p:211-239:10.1023/a:1018986731638

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018986731638

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().