Two Simple Constructive algorithms for the Distributed Assembly Permutation Flowshop Scheduling Problem

  • Sara HatamiEmail author
  • Rubén Ruiz
  • Carlos Andrés Romano
Conference paper
Part of the Lecture Notes in Management and Industrial Engineering book series (LNMIE)


Nowadays, it is necessary to improve the management of complex supply chains which are often composed of multi-plant facilities. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP). This problem is a generalization of the Distributed Permutation Flowshop Scheduling Problem (DPFSP) presented by Naderi and Ruiz (Comput Oper Res, 37(4):754–768, 2010). The first stage of the DAPFSP is composed of f identical production factories. Each center is a flowshop that produces jobs that have to be assembled into final products in a second assembly stage. The objective is to minimize the makespan. Two simple constructive algorithms are proposed to solve the problem. Two complete sets of instances (small-large) are considered to evaluate performance of the proposed algorithms.


Distributed assembly flowshop Permutation flowshop constructive algorithms 


  1. 1.
    Al-Anzi F, Allahverdi A (2006) A hybrid tabu search heuristic for the two-stage assembly scheduling problem. Int J of Oper Res 3(2):109–119zbMATHMathSciNetGoogle Scholar
  2. 2.
    Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New YorkGoogle Scholar
  3. 3.
    Framinan J, Leisten R (2003) An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega Int J Manage Sci 31(4):311–317CrossRefGoogle Scholar
  4. 4.
    Koulamas C, Kyparisis GJ (2001) The three stage assembly flowshop scheduling problem. Comput Oper Res 28(7):689–704CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Naderi B, Ruiz R (2010) The distributed permutation flowshop scheduling problem. Comput Oper Res 37(4):754–768CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Pan QK, Ruiz R (2012) Local search methods for the flowshop scheduling problem with flowtime minimization. Eur J Oper Res 222(1):31–43CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Pinedo M (2012) Scheduling: theory, algorithms and systems, 4th edn. Springer, New YorkCrossRefGoogle Scholar
  8. 8.
    Tozkapan A, Kirca O, Chung CS (2003) A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Comput Oper Res 30(2):309–320CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Sara Hatami
    • 1
    Email author
  • Rubén Ruiz
    • 2
  • Carlos Andrés Romano
    • 3
  1. 1.Departamento de Estadística e Investigación Operativa, Facultad de Ciencias MatemáticasUniversitat de ValènciaValènciaSpain
  2. 2.Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de InformáticaUniversitat Politècnica de València, Ciudad Politécnica de la Innovación, Edifico 8GValènciaSpain
  3. 3.Research Group in Reengineering, Operations ManagementGroup Work and Logistics Excellence, Industriales, Universitat Politècnica de València CnoValènciaSpain

Personalised recommendations