Skip to main content
SpringerLink
Log in

Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we consider the problem of scheduling \(n\) jobs in an \(m\)-machine permutation flowshop with minimal time lags between consecutive operations of each job. The processing order of jobs is to be the same for each machine. The time lag is defined as the waiting time between two consecutive operations of each job. Upper bounds for the problem are provided by applying heuristic procedures based on known and new rules. Lower bounds based on Moore’s algorithm and logic-based Benders decomposition are developed. For the last one, we define a long time horizon on the last machine divided into many segments of time. We combine a mixed integer linear programming to allocate jobs to time segments and scheduled using the constraint programming. Then, computational results are reported.

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

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Chu, C., Proth, J.M.: Single machine scheduling with chain structured precedence constraints and separation time windows. IEEE Trans. Robot. Autom. 12, 835–844 (1996)

    Article  Google Scholar 

  2. Coban, E., Hooker, J.N.: Single-facility scheduling over long time horizons by logic-based benders decomposition. In: Proceedings of CPAIOR, pp. 87–91 (2010)

  3. Croce, F.D., Gupta, G.N.D., Tadei, R.: Minimizing tardy jobs in a flowshop with common due date. Eur. J. Oper. Res. 120, 375–81 (2000)

    Article  MATH  Google Scholar 

  4. Deppner, F.: Ordonnancement d’atelier avec contraintes temporelles entre operations. Ph.D. Thesis, Institut National Polytechnique de Lorraine (in French) (2004)

  5. Dhouib, E., Teghem, J., Loukil, T.: Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints. J. Math. Model. Algorith. Oper. Res. 12, 85–99 (2013)

    MATH  MathSciNet  Google Scholar 

  6. Fondrevelle, J., Oulamara, A., Portmann, M.C.: Permutation flowshop scheduling problems with maximal and minimal time lags. Comput. Oper. Res. 33, 1540–1556 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ghassemi, T.F., Olfat, L.: A set of algorithms for solving the generalized tardiness flowshop problems. J. Ind. Syst. Eng. 4, 156–166 (2010)

    Google Scholar 

  8. Graham, R., Lawler, E., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hariri, A.M.A., Potts, C.N.: A branch and bound algorithm to minimize the number of late jobs in a permutation flowshop. Eur. J. Oper. Res. 38, 228–237 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  10. Harjunkoski, I., Grossmann, I.E.: Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput. Chem. Eng. 26, 1533–1552 (2002)

    Article  Google Scholar 

  11. Hooker, J.N., Yan, H.: Logic circuit verification by Benders decomposition. In: Saraswat, V., Van Hentenryck, P. (eds.) Principles and Practice of Constraint Programming: The Newport Papers, pp. 267–288. MIT Press, Cambridge (1995)

    Google Scholar 

  12. Hooker, J.N.: Logic-based Benders decomposition. Carnegie-Mellon University, Technical report (1995)

  13. Hooker, J.N.: A hybrid method for planning and scheduling. In: Wallace, M. (ed.) Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 3258, pp. 305–316. Springer, Berlin (2004)

    Google Scholar 

  14. Hooker, J.N.: Planning and scheduling to minimize tardiness. In: van Beek, P. (ed.) Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 3709, pp. 314–327. Springer, Berlin (2005)

    Google Scholar 

  15. Hooker, J.N.: Planning and scheduling by logic-based benders decomposition. Oper. Res. 55, 588–602 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Jain, V., Grossmann, I.E.: Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS J. Comput. 13, 258–276 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343–362 (1977)

    Article  MathSciNet  Google Scholar 

  18. Lodree, E., Jang, W., Klein, C.M.A.: New rule for minimizing the nuımber of tardy jobs in dynamic flowshops. Eur. J. Oper. Res. 159, 258–263 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  19. Moore, J.M.: An n job one machine algorithm for minimizing the number of late jobs. Manage. Sci. 15, 102–109 (1968)

    Article  MATH  Google Scholar 

  20. Ruiz-Torres, A.J., Ablanedo-Rosasb, J.H., Johnny, C.H.: Minimizing the number of tardy jobs in the flow shop problem with operation and resource flexibility. Comput. Oper. Res. 37, 282–291 (2010)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Unit LOGIQ, High Institute of Industrial Management, University of Sfax, Sfax, 3018, Tunisia

    Imen Hamdi & Taïcir Loukil

Authors
  1. Imen Hamdi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Taïcir Loukil
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Imen Hamdi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hamdi, I., Loukil, T. Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags. Optim Lett 9, 465–482 (2015). https://doi.org/10.1007/s11590-014-0761-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0761-7

Keywords

Search

Navigation