Advertisement

Journal of Scheduling

, Volume 14, Issue 3, pp 239–256 | Cite as

Inverse scheduling: two-machine flow-shop problem

  • Peter Brucker
  • Natalia V. ShakhlevichEmail author
Article

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.

Keywords

Inverse scheduling Flow shop scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R. K., & Orlin, J. B. (2001). Inverse optimization. Operations Research, 49, 771–783. CrossRefGoogle Scholar
  2. Brucker, P. (2004). Scheduling algorithms. Berlin: Springer. Google Scholar
  3. Brucker, P., & Shakhlevich, N. V. (2009). Inverse scheduling with maximum lateness objective. Journal of Scheduling, 12, 475–488. CrossRefGoogle Scholar
  4. Duin, C. W., & Volgenant, A. (2006). Some inverse optimization problems under the Hamming distance. European Journal of Operational Research, 170, 887–899. CrossRefGoogle Scholar
  5. Gűller, C., & Hamacher, H. W. (2010, to appear). Capacity inverse minimum cost flow problem. Journal of Combinatorial Optimization. Google Scholar
  6. Heuberger, C. (2004). Inverse combinatorial optimization: a survey on problems, methods and results. Journal of Combinatorial Optimization, 8, 329–361. CrossRefGoogle Scholar
  7. Hochbaum, D. S., & Hong, S.-P. (1995). About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Mathematical Programming, 69, 269–309. Google Scholar
  8. Johnson, S. M. (1954). On two and three-stage production scheduling with setup times included. Naval Research Logistics Quarterly, 1, 61–67. CrossRefGoogle Scholar
  9. Katoh, N., & Ibaraki, T. (1998). Resource allocation problems. In Du, D.-Z., & Pardalos, P. M. (Eds.), Handbook of combinatorial optimization (Vol. 2, pp. 159–260). Dordrecht: Kluwer Academic. Google Scholar
  10. Koulamas, C. (2005). Inverse, scheduling with controllable job parameters. International Journal of Services and Operations Management, 1, 35–43. CrossRefGoogle Scholar
  11. Lin, Y., & Wang, X. (2007). Necessary and sufficient conditions of optimality for some classical scheduling problems. European Journal of Operational Research, 176, 809–818. CrossRefGoogle Scholar
  12. Liu, L. C., & Zhang, J. Z. (2006). Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization, 12, 395–408. CrossRefGoogle Scholar
  13. Tarantola, A. (2005). Inverse problem theory and methods for model parameter estimation. Philadelphia: SIAM. CrossRefGoogle Scholar
  14. Wang, L. Z. (2009). Cutting plane algorithms for the inverse mixed integer linear programming problem. Operations Research Letters, 37, 114–116. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Fachbereich Mathematik/InformatikUniversität OsnabrückOsnabrückGermany
  2. 2.School of ComputingUniversity of LeedsLeedsUK

Personalised recommendations