A New Constructive Heuristic for the Fm|block|ΣT

  • Ramon Companys PascualEmail author
  • Imma Ribas Vila
Conference paper
Part of the Lecture Notes in Management and Industrial Engineering book series (LNMIE)


This paper deals with the blocking flow shop problem and proposes new constructive procedures for the total tardiness minimization of jobs. The heuristic has three-phases to build the sequence; the first phase selects the first job to be scheduled, the second phase arranges the remaining jobs and the third phase uses the insertion procedure of NEH to improve the sequence. The proposed procedures evaluate the tardiness associated to the sequence obtained before and after the third phase in order to keep the best of both because the insertion phase can worsen the result. The computational evaluation of these procedures against the benchmark constructive procedures from the literature reveals their good performance.


Flow shop Blocking Tardiness 


  1. 1.
    Armentano VA, Ronconi DP (1999) Tabu search for total tardiness minimization in flowshop scheduling problems. Comput Oper Res 26(3):219–235CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Armentano VA, Ronconi DP (2000) Minimização do tempo total de atraso no problema de flowshop com buffer zero através de busca tabu. Gestao Produçao 7(3):352CrossRefGoogle Scholar
  3. 3.
    Gong H, Tang L, Duin CW (2010) A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Comput Oper Res 37(5):960–969CrossRefzbMATHGoogle Scholar
  4. 4.
    Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125(3):535–550CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no wait in process. Oper Res 44(3):510–525CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Martinez S, Dauzère-Pérès S, Guéret C, Mati Y, Sauer N (2006) Complexity of flowshop scheduling problems with a new blocking constraint. Eur J Oper Res 169(3):855–864CrossRefzbMATHGoogle Scholar
  8. 8.
    Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91–95CrossRefGoogle Scholar
  9. 9.
    Potts CN, Van Wassenhove LN (1982) A decomposition algorithm for the single machine total tardiness problem. Oper Res Lett 1(5):177–181CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Ronconi DP, Henriques LRS (2009) Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega 37(2):272–281CrossRefGoogle Scholar
  11. 11.
    Sethi SP, Sriskandarajah C, Sorger G, Blazewicz J, Kubiak W (1992) Sequencing of parts and robot moves in a robotic cell. Int J Flexible Manuf Syst 4:331–358CrossRefGoogle Scholar
  12. 12.
    Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Dpto. de Organización de Empresas, Escola Tècnica Superior d’Enginyers Industrials de BarcelonaUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations