Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

Philippe Baptiste () and Vadim G. Timkovsky ()

Mathematical Methods of Operations Research, 2004, vol. 60, issue 1, 145-153

Abstract: Ideal schedules reach both minimum maximum completion time and minimum total completion time of jobs. It is known that there exist computable in polynomial time ideal nonpreemptive two-machine schedules of unit-time operation jobs with equal release dates and arbitrary precedence constraints on identical parallel machines, in flow shops and open shops. In this paper, we study the possibility of extending these results to the case where release dates can be different. We establish the complexity status of P2|prec,r j ,p j =1|∑C j and F2|prec,r j ,p ij =1|∑C j showing that optimal schedules for these problems can also be found in polynomial time and conjecture that all such schedules are ideal indeed. On the other hand, we show that the ideal schedules in open shops do not always exist. Copyright Springer-Verlag 2004

Keywords: Scheduling; Parallel machine; Flowshop; Complexity (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860300336 (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:mathme:v:60:y:2004:i:1:p:145-153

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

DOI: 10.1007/s001860300336

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().