Advertisement

Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness

  • Débora P. RonconiEmail author
  • Ernesto G. Birgin
Chapter
Part of the Springer Optimization and Its Applications book series (SOIA, volume 60)

Abstract

Scheduling problems involving both earliness and tardiness costs have received significant attention in recent years. This type of problem became important with the advent of the just-in-time (JIT) concept, where early or tardy deliveries are highly discouraged. In this work we examine the flowshop scheduling problem with no storage constraints and with blocking in-process. In this latter environment, there are no buffers between successive machines; therefore, intermediate queues of jobs waiting in the system for their next operations are not allowed. Performance is measured by the minimization of the sum of earliness and tardiness of the jobs. Mixed-integer models that represent these scheduling flowshop problems are presented. The models are evaluated and compared in several problems using commercial known software.

Notes

Acknowledgements

This work was supported by PRONEX-CNPq/FAPERJ (E-26/171.1510/2006-APQ1), FAPESP (Grants 2006/53768-0, 2006/03496-3 and 2009/10241-0), and CNPq (308000/2009-9 and 304484/2007-5).

References

  1. 1.
    Biskup, D., Feldmann, M.: Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates. Computers & Operations Research 28, 787–801 (2001)zbMATHCrossRefGoogle Scholar
  2. 2.
    Brandimarte, P.: Neighbourhood search-based optimization algorithms for production scheduling: a survey. Running Series - Designing Production Order Scheduling Tools 5(2) (1992)Google Scholar
  3. 3.
    Dudek, R.A., Panwalkar, S.S., Smith, M.L.: The lessons of flowshop scheduling research. Operations Research 40, 7–13 (1992)zbMATHCrossRefGoogle Scholar
  4. 4.
    Grabowski, J., Pempera, J.: The permutation flow shop problem with blocking: A Tabu Search approach. Omega 35, 302–311 (2007)CrossRefGoogle Scholar
  5. 5.
    Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44, 510–525 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kanet, J.J., Sridharan, V.: Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research 48, 99–110 (2000)CrossRefGoogle Scholar
  7. 7.
    Kim, Y.D.: Minimizing total tardiness in permutation flowshops. European Journal of Operational Research 85, 541–555 (1995)zbMATHCrossRefGoogle Scholar
  8. 8.
    Leisten, R.: Flowshop sequencing with limited buffer storage. International Journal of Production Research 28, 2085–2100 (1990)zbMATHCrossRefGoogle Scholar
  9. 9.
    Liao, C.J., You, C.T.: An improved formulation for the job-shop scheduling problem. Journal of the Operational Research Society 43, 1047–1054 (1992)zbMATHGoogle Scholar
  10. 10.
    Manne, A.S.: On the job-shop scheduling problem. Operations Research 8, 219–223 (1960)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Pan, C.H.: A study of integer programming formulations for scheduling problems. International Journal of Systems Science 28, 33–41 (1997)zbMATHCrossRefGoogle Scholar
  12. 12.
    Potts, C.N., van Wassenhove, L.N.: A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters 1, 177–181 (1982)zbMATHCrossRefGoogle Scholar
  13. 13.
    Reklaitis, G.V.: Review of scheduling of process operations. AIChE Symposium Series 78, 119–133 (1982)Google Scholar
  14. 14.
    Ronconi, D.P.: A contribution to the study of the flowshop problem minimizing the total tardiness. Ph.D. Dissertation (in portuguese), UNICAMP, Campinas, Brazil (1997)Google Scholar
  15. 15.
    Sen, T., Gupta, S.K.: A state-of-art survey of static scheduling research involving due dates. Omega 12, 63–76 (1984)CrossRefGoogle Scholar
  16. 16.
    Sethi, S.P., Sriskandarajah, C., Sorger, G., Blazewicz, J., Kubiak, W.: Sequencing of parts and robot moves in a robotic cell. International Journal of Flexible Manufacturing Systems 4, 331–358 (1992)CrossRefGoogle Scholar
  17. 17.
    Stafford, E.F.: On the development of a mixed-integer linear programming model for the flowshop sequencing problem. Journal of the Operational Research Society 39, 1163–1174 (1988)zbMATHGoogle Scholar
  18. 18.
    Stafford, E.F., Tseng, F.T.,J. N., Gupta, J.N.D.: Comparative evaluation of MILP flowshop models. Journal of the Operational Research Society 56, 88–101 (2005)Google Scholar
  19. 19.
    Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)zbMATHCrossRefGoogle Scholar
  20. 20.
    Wagner, H.M.: An integer linear-programming model for machine scheduling. Naval Research Logistic 6, 131–140 (1959)CrossRefGoogle Scholar
  21. 21.
    Wilson, J.M.: Alternative formulations of a flow-shop scheduling problem. Journal of the Operational Research Society 40, 395–399 (1989)zbMATHGoogle Scholar
  22. 22.
    Zhu, Z., Heady, R.B.: Minimizing the sum of earliness/tardiness in multimachine scheduling: a mixed integer programming approach. Computers & Industrial Engineering 38, 297–305 (2000)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Department of Production Engineering, EP-USPUniversity of São PauloSão PauloBrazil
  2. 2.Department of Computer Science, IME-USPUniversity of São PauloSão PauloBrazil

Personalised recommendations