Skip to main content
SpringerLink
Log in

Inverse scheduling: two-machine flow-shop problem

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ahuja, R. K., & Orlin, J. B. (2001). Inverse optimization. Operations Research, 49, 771–783.

    Article  Google Scholar 

  • Brucker, P. (2004). Scheduling algorithms. Berlin: Springer.

    Google Scholar 

  • Brucker, P., & Shakhlevich, N. V. (2009). Inverse scheduling with maximum lateness objective. Journal of Scheduling, 12, 475–488.

    Article  Google Scholar 

  • Duin, C. W., & Volgenant, A. (2006). Some inverse optimization problems under the Hamming distance. European Journal of Operational Research, 170, 887–899.

    Article  Google Scholar 

  • Gűller, C., & Hamacher, H. W. (2010, to appear). Capacity inverse minimum cost flow problem. Journal of Combinatorial Optimization.

  • Heuberger, C. (2004). Inverse combinatorial optimization: a survey on problems, methods and results. Journal of Combinatorial Optimization, 8, 329–361.

    Article  Google Scholar 

  • 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 

  • Johnson, S. M. (1954). On two and three-stage production scheduling with setup times included. Naval Research Logistics Quarterly, 1, 61–67.

    Article  Google Scholar 

  • 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 

  • Koulamas, C. (2005). Inverse, scheduling with controllable job parameters. International Journal of Services and Operations Management, 1, 35–43.

    Article  Google Scholar 

  • Lin, Y., & Wang, X. (2007). Necessary and sufficient conditions of optimality for some classical scheduling problems. European Journal of Operational Research, 176, 809–818.

    Article  Google Scholar 

  • Liu, L. C., & Zhang, J. Z. (2006). Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization, 12, 395–408.

    Article  Google Scholar 

  • Tarantola, A. (2005). Inverse problem theory and methods for model parameter estimation. Philadelphia: SIAM.

    Book  Google Scholar 

  • Wang, L. Z. (2009). Cutting plane algorithms for the inverse mixed integer linear programming problem. Operations Research Letters, 37, 114–116.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität Osnabrück, 49069, Osnabrück, Germany

    Peter Brucker

  2. School of Computing, University of Leeds, Leeds, LS2 9JT, UK

    Natalia V. Shakhlevich

Authors
  1. Peter Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natalia V. Shakhlevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Natalia V. Shakhlevich.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brucker, P., Shakhlevich, N.V. Inverse scheduling: two-machine flow-shop problem. J Sched 14, 239–256 (2011). https://doi.org/10.1007/s10951-010-0168-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-010-0168-y

Keywords

Search

Navigation