Brucker, P and Shakhlevich, NV (2011) Inverse scheduling: two machine flow shop problem. Journal of Scheduling, 14 (3). 239 - 256. ISSN 1094-6136
Abstract
We study an inverse counterpart of the two-machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected within given boundaries so that pre-specified job sequence(s) become optimal. We derive necessary and sufficient conditions of optimality of a given solution for the general case of the flow-shop problem when the job sequences on the machines can be different. Based on these conditions we prove that the inverse flow-shop problem is NP-hard even in the case of the same job sequence on both machines and produce a linear programming formulation for a special case which can be solved efficiently
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2011 Springer. This is an author produced version of a paper published in Journal of Scheduling. Reproduced in accordance with the publisher's self-archiving policy. The final publication is available at Springer via http://dx.doi.org/10.1007/s10951-010-0168-y |
Keywords: | Inverse scheduling; flow shop scheduling |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 08 Dec 2014 09:59 |
Last Modified: | 24 Jan 2018 03:44 |
Published Version: | http://dx.doi.org/10.1007/s10951-010-0168-y |
Status: | Published |
Publisher: | Springer Verlag |
Refereed: | Yes |
Identification Number: | 10.1007/s10951-010-0168-y |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:81533 |