Open Shop Scheduling with Synchronization
Christoph Weiss (),
S. Waldherr (),
S. Knust () and
N. V. Shakhlevich ()
Additional contact information
S. Waldherr: University of Osnabrück
S. Knust: University of Osnabrück
N. V. Shakhlevich: University of Leeds
Journal of Scheduling, 2017, vol. 20, issue 6, 557-581
Abstract In this paper, we study open shop scheduling problems with synchronization. This model has the same features as the classical open shop model, where each of the n jobs has to be processed by each of the m machines in an arbitrary order. Unlike the classical model, jobs are processed in synchronous cycles, which means that the m operations of the same cycle start at the same time. Within one cycle, machines which process operations with smaller processing times have to wait until the longest operation of the cycle is finished before the next cycle can start. Thus, the length of a cycle is equal to the maximum processing time of its operations. In this paper, we continue the line of research started by Weiß et al. (Discrete Appl Math 211:183–203, 2016). We establish new structural results for the two-machine problem with the makespan objective and use them to formulate an easier solution algorithm. Other versions of the problem, with the total completion time objective and those which involve due dates or deadlines, turn out to be NP-hard in the strong sense, even for $$m=2$$ m = 2 machines. We also show that relaxed models, in which cycles are allowed to contain less than m jobs, have the same complexity status.
Keywords: Open shop; Synchronization; Complexity (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s10951-016-0490-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:20:y:2017:i:6:d:10.1007_s10951-016-0490-0
Ordering information: This journal article can be ordered from
Access Statistics for this article
Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo
More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla ().