Skip to main content
SpringerLink
Log in

Minimizing total completion time in the two-machine no-idle no-wait flow shop problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

We consider the two-machine total completion time flow shop problem with additional requirements. These requirements are the so-called no-idle constraint where the machines must operate with no inserted idle time and the so-called no-wait constraint where jobs cannot wait between the end of an operation and the start of the following one. We propose a matheuristic approach that uses an ILP formulation based on positional completion times variables and exploits the structural properties of the problem. The proposed approach shows very competitive performances on instances with up to 500 jobs in size.

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
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Adiri, I., Pohoryles, D.: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Nav. Res. Logist. 29, 495–504 (1982)

    Article  MathSciNet  Google Scholar 

  • Allahverdi, A.: A survey of scheduling problems with no-wait in process. Eur. J. Oper. Res. 255, 665–686 (2016)

    Article  MathSciNet  Google Scholar 

  • Baptiste, P., Lee, K.H.: A branch and bound algorithm for the \(F | no-idle | C_{\max }\). In: Proceedings of the International Conference on Industrial Engineering and Production Management, vol. 1, pp. 429–438 (1997)

  • Billaut, J.C., Della Croce, F., Salassa, F., T’kindt, V.: When shop scheduling meets dominoes, Eulerian and Hamiltonian paths. J. Sched. 22(1), 59–68 (2019)

  • Chrétienne, P.: On scheduling with the non-idling constraint. 4OR 12, 101–121 (2014)

    Article  MathSciNet  Google Scholar 

  • Della Croce, F., Grosso, A., Salassa, F.: A matheuristic approach for the two-machine total completion time flow shop problem. Ann. Oper. Res. 213, 67–78 (2014)

    Article  MathSciNet  Google Scholar 

  • Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117–129 (1976)

    Article  MathSciNet  Google Scholar 

  • Gilmore, P.C., Gomory, R.E.: Sequencing a one state variable machine: a solvable case of the traveling salesman problem. Oper. Res. 12, 655–679 (1964)

    Article  MathSciNet  Google Scholar 

  • Goncharov, Y., Sevastyanov, S.: The flow shop problem with no-idle constraints: a review and approximation. Eur. J. Oper. Res. 196, 450–456 (2009)

    Article  MathSciNet  Google Scholar 

  • Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44, 510–525 (1996)

    Article  MathSciNet  Google Scholar 

  • Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logist. Q. 1, 61–68 (1954)

    Article  Google Scholar 

  • Kalczynski, P.J., Kamburowski, J.: On no-wait and no-idle flow shops with makespan criterion. Eur. J. Oper. Res. 178, 677–685 (2007)

    Article  MathSciNet  Google Scholar 

  • Koulamas, C., Panwalkar, S.S.: New index priority rules for no-wait flow shops. Comput. Ind. Eng. 115, 647–652 (2018)

    Article  Google Scholar 

  • Lasserre, J.B., Queyranne, M.: Generic scheduling polyhedral and a new mixed integer formulation for single machine scheduling. In: Proceedings of the IPCO Conference, pp. 136–149 (1992)

  • Lin, S., Ying, K.: Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics. Omega 64, 115–125 (2016)

    Article  Google Scholar 

  • Nagano, M.S., Rossi, F.L., Junqueira Martarelli, N.: High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Eng. Optim. 51(185–198), 2019 (2019)

    MathSciNet  Google Scholar 

  • Reddi, S.S., Ramamoorthy, C.V.: On the flowshop sequencing problem with no-wait in process. Oper. Res. Q. 23, 323–331 (1972)

    Article  Google Scholar 

  • Röck, H.: The three machine no-wait flowshop problem is NP-complete. J. Assoc. Comput. Mach. 31, 336–345 (1984)

    Article  MathSciNet  Google Scholar 

  • Ying, K., Lin, S., Cheng, C., He, C.: Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems. Comput. Ind. Eng. 110, 413–423 (2017)

    Article  Google Scholar 

  • Zhao, F., Liu, H., Zhang, Y., Ma, W., Zhang, C.: A discrete water wave optimization algorithm for no-wait flow shop scheduling problem. Expert Syst. Appl. 91, 347–363 (2018)

    Article  Google Scholar 

Download references

Acknowledgements

This work has been partially supported by “Ministero dell’Istruzione, dell’Università e della Ricerca” Award “TESUN-83486178370409 finanziamento dipartimenti di eccellenza CAP. 1694 TIT. 232 ART. 6”.

Author information

Authors and Affiliations

  1. DIGEP, Politecnico di Torino, Torino, Italy

    Federico Della Croce & Fabio Salassa

  2. CNR, IEIIT, Torino, Italy

    Federico Della Croce

  3. D.I., Universitá degli Studi di Torino, Turin, Italy

    Andrea Grosso

Authors
  1. Federico Della Croce
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Grosso
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fabio Salassa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Federico Della Croce.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Della Croce, F., Grosso, A. & Salassa, F. Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. J Heuristics 27, 159–173 (2021). https://doi.org/10.1007/s10732-019-09430-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-019-09430-z

Keywords

Search

Navigation