Inverse scheduling: two‐machine flow‐shop problem

Inverse scheduling: two‐machine flow‐shop problem

0.00 Avg rating0 Votes
Article ID: iaor20115770
Volume: 14
Issue: 3
Start Page Number: 239
End Page Number: 256
Publication Date: Jun 2011
Journal: Journal of Scheduling
Authors: ,
Keywords: programming: linear
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.

Reviews

Required fields are marked *. Your email address will not be published.