Skip to main content
SpringerLink
Log in

A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines

  • Short Communication
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The paper proposes a Mixed Integer Programming (MIP) formulation of the scheduling problem with total flow criterion on a set of parallel unrelated machines under an uncertainty context about the processing times. To model the problem we assume that lower and upper bounds are known for each processing time. In this context we consider an optimal minmax regret schedule as a suitable approximation to the optimal schedule under an arbitrary choice of the possible processing times.

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

References

  1. Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33(6), 634–640 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aissi, H., Bazgan, C., Vanderpooten, D.: Min-max and min-max regret versions of combinatorial optimization problems: a survey. Eur. J. Oper. Res. 197(2), 427–438 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arroyo, J.M., Alguacil, N., Carrión, M.: A risk-based approach for transmission network expansion planning under deliberate outages. IEEE Trans. Power Syst. 25(3), 1759–1766 (2010)

    Article  Google Scholar 

  4. Aytug, H., Lawley, M.A., McKay, K., Mohan, S., Uzsoy, R.: Executing production schedules in the face of uncertainties: a review and some future directions. Eur. J. Oper. Res. 161(1), 86–110 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Burkard, R.E., Dell’Amico, M., Martello, S.: Assignment problems. SIAM (2009)

  6. Conde, E.: A 2-approximation for minmax regret problems via a mid-point scenario optimal solution. Oper. Res. Lett. 38, 326–327 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  7. Daniels, R.L., Kouvelis, P.: Robust scheduling to hedge against processing time uncertainty in single-stage production. Manage. Sci. 41(2), 363–376 (1995)

    Article  MATH  Google Scholar 

  8. Herroelen, W., Leus, R.: Project scheduling under uncertainty: survey and research potentials. Eur. J. Oper. Res. 165(2), 289–306 (2005)

    Google Scholar 

  9. Kenneth, Holmström: The TOMLAB Optimization Environment in Matlab. Adv. Model. Optim. 1(1), 47–69 (1999)

    MATH  Google Scholar 

  10. Horn, W.A.: Minimizing average flow time with parallel machines. Operat. Res. 21(3), 846–847 (1973)

    Article  MATH  Google Scholar 

  11. Kasperski, A.: Discrete optimization with interval data, Minmax regret and fuzzy approach. Studies in Fuzziness and Soft Computing. Springer, New York (2008)

    Google Scholar 

  12. Kasperski, A., Kurpisz, A., Zieliński, P.: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. Eur. J. Oper. Res. 217(1), 36–43 (2012)

    Article  MATH  Google Scholar 

  13. Kasperski, A., Zieliński, P.: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion. Oper. Res. Lett. 36(3), 343–344 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kasperski, A., Zieliński, P.: Possibilistic minmax regret sequencing problems with fuzzy parameters. IEEE Trans. Fuzzy Syst. 19(6), 1072–1082 (2011)

    Article  Google Scholar 

  15. Kouvelis, P., Daniels, R.L., Vairaktarakis, G.: Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Trans. 32(5), 421–432 (2000). (Institute of Industrial Engineers)

    Google Scholar 

  16. Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publisher, USA (1997)

    Book  MATH  Google Scholar 

  17. Lai, T.-C., Sotskov, YuN: Sequencing with uncertain numerical data for makespan minimisation. J. Oper. Res. Soc. 50(2–3), 230–243 (1999)

  18. Lai, T.-C., Sotskov, YuN, Sotskova, N., Werner, F.: Mean flow time minimization with given bounds of processing times. Eur. J. Oper. Res. 159(3), 558–573 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  19. Lai, T.-C., Sotskov, YuN, Werner, F.: Optimal makespan scheduling with given bounds of processing times. Math. Comput. Model. 26(3), 67–86 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  20. Lebedev, V., Averbakh, I.: Complexity of minimizing the total flow time with interval data and minmax regret criterion. Discrete Appl. Math. 154(15), 2167–2177 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  21. Lin, J., Ng, T.S.: Robust multi-market newsvendor models with interval demand data. Eur. J. Oper. Res. 212(2), 361–373 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  22. Lu, C.-C., Lin, S.-W., Ying, K.-C.: Robust scheduling on a single machine to minimize total flow time. Comput. Oper. Res. 39(7), 1682–1691 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  23. Mahjoub, A., Pecero Sánchez, J.E.: Scheduling with uncertainties on new computing platforms. Comput. Optim. Appl. 48(2), 369–398 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  24. Miranda, V., Proenca, L.M.: Why risk analysis outperforms probabilistic choice as the effective decision support paradigm for power system planning. IEEE Trans. Power Syst. 13(2), 643–648 (1998)

    Article  Google Scholar 

  25. Montemanni, R.: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data. J. Math. Model. Algorithms 6(2), 287–296 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  26. Owen, S.H., Daskin, M.S.: Strategic facility location: a review. Eur. J. Oper. Res. 111(3), 423–447 (1998)

    Article  MATH  Google Scholar 

  27. Pereira, J., Averbakh, I.: Exact and heuristic algorithms for the interval data robust assignment problem. Comput. Oper. Res. 38(8), 1153–1163 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  28. Pinedo, M.L.: Scheduling: theory, algorithms, and systems. Springer, New York (2010)

    Google Scholar 

  29. Siepak, M., Józefczyk, J.: Minmax regret algorithms for uncertain P||Cmax problem with interval processing times. Proceedings of ICSEng 2011: international conference on systems engineering, pp. 115–119 (2011)

  30. Snyder, L.V.: Facility location under uncertainty: a review. IIE Trans. 38(7), 547–564 (2006). (Institute of Industrial Engineers)

    Article  Google Scholar 

  31. Sotskov, YuN, Egorova, N.G., Lai, T.-C.: Minimizing total weighted flow time of a set of jobs with interval processing times. Math. Comput. Model. 50, 556–573 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  32. Yang, J., Yu, G.: On the robust single machine scheduling problem. J. Comb. Optim. 6(1), 17–33 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

This research has been funded by the Spanish Ministry of Science and Technology project MTM2010-19576-C02-01. The author would like to thank the anonymous referees for their constructive comments which contributed to improve the quality of the paper.

Author information

Authors and Affiliations

  1. Department of Statistics and Operations Research, Faculty of Mathematics, University of Seville, Campus Reina Mercedes, 41011 , Sevilla, Spain

    Eduardo Conde

Authors
  1. Eduardo Conde
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eduardo Conde.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Conde, E. A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines. Optim Lett 8, 1577–1589 (2014). https://doi.org/10.1007/s11590-013-0655-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-013-0655-0

Keywords

Search

Navigation