Weiß, C, Waldherr, S, Knust, S et al. (1 more author) (2017) Open Shop Scheduling with Synchronization. Journal of Scheduling, 20 (6). pp. 557-581. ISSN 1094-6136
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 machines. We also show that relaxed models, in which cycles are allowed to contain less than m jobs, have the same complexity status.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © The Author(s) 2016. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
Keywords: | open shop; synchronization; complexity |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number EPSRC EP/K041274/1 |
Depositing User: | Symplectic Publications |
Date Deposited: | 15 Jul 2016 14:41 |
Last Modified: | 23 Jun 2023 22:09 |
Published Version: | http://dx.doi.org/10.1007/s10951-016-0490-0 |
Status: | Published |
Publisher: | Springer Verlag |
Identification Number: | 10.1007/s10951-016-0490-0 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:102421 |