Optimal Sequence Identification in Parallel Flow Line Environment Using Heuristics

  • N. Rajeswari
  • K. BalasubramanianEmail author
Conference paper
Part of the Lecture Notes in Mechanical Engineering book series (LNME)


In manufacturing environment, it is necessary to find the sequence of jobs on different machines; so that technological constraints are satisfied and the performance criteria are optimized. This paper explores parallel flow line scheduling environment where similar set of machines with varying capabilities exist. The jobs are required to be processed by every machine available in the assigned line and the processing time of similar machines differs between lines. The complexity increases in parallel flow line scheduling because it combines both the flow shop and parallel machine arrangement. This work concentrates on the considered objective, i.e., minimization of makespan in a large parallel flow line machine setup using three metaheuristics, namely Genetic Algorithm (GA), Simulated Annealing (SA), and Bee Colony Algorithm (ABC). To perform computations, a code with Visual Basic language was developed and run on a personal computer. From the test conducted on a set of randomly generated problems demonstrates that GA outperforms SA for the given objective. Secondly, the solutions of GA are compared with ABC Algorithm and inferred that GA outperforms in all instances. Thirdly, the solutions of SA and ABC algorithm are compared. On comparing the results of various algorithms on the same set of problems considered, it is revealed that GA outperforms other algorithms for the chosen conditions of random samples. To measure the efficiency of algorithms apart from the fitness function, computational time taken to achieve the near optimal sequence in the instances is also considered.


Parallel flow line setup Optimal sequences Metaheuristics 


  1. 1.
    Aldulaimi BF, Ali HA (2008) A novel genetic algorithm approach for solving flow shop problem. Int J Comput Sci Netw Secur 8(9):229–235Google Scholar
  2. 2.
    Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. J Naval Res Logistics Q 1(1):61–68CrossRefGoogle Scholar
  3. 3.
    Chen CL, Bulfin RL (1993) Complexity of single machine, multi-criteria scheduling problems. Eur J Oper Res 70(1):115–125CrossRefGoogle Scholar
  4. 4.
    Mosheiov G (2002) Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl Mathematics 117(1):195–209MathSciNetCrossRefGoogle Scholar
  5. 5.
    Chen F, Lee CY (2009) Minimizing the makespan in a two-machine cross-docking flow shop problem. Eur J Oper Res 193(1), 59–72MathSciNetCrossRefGoogle Scholar
  6. 6.
    Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108–132MathSciNetzbMATHGoogle Scholar
  7. 7.
    Czapinski M (2010) Parallel simulated annealing with genetic enhancement for flow shop problem with Csum. Comput Ind Eng 59(4):778–785CrossRefGoogle Scholar
  8. 8.
    Chettha C, Kanchana S (2013) Heuristics for scheduling hybrid flow shop with time windows. Int J Eng Technol 5(1):41–44Google Scholar
  9. 9.
    Younes N, Santo DL, Maria A (1998) A simulated annealing approach to scheduling in a flow shop with multiple processors. In: Industrial engineering research conference proceedings, Banff, Canada, pp 1–8Google Scholar
  10. 10.
    Yang T (2009) An evolutionary simulation optimization approach in solving parallel machine scheduling problems—a case study. J Comput Indus Eng 56(3):1126–1136CrossRefGoogle Scholar
  11. 11.
    Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Numerical simulation of annealing—equation of state calculations by fast computing machines. J Chem Phys 21(5):1087–1092CrossRefGoogle Scholar
  12. 12.
    Kirkpatrick S, Gellat CD, Vecchi MP (1983) Optimization by simulated annealing. J Sci 220(4598):671–680MathSciNetCrossRefGoogle Scholar
  13. 13.
    Ruiz R, Vázquez-Rodríguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1–18MathSciNetCrossRefGoogle Scholar
  14. 14.
    Edis EB, Oguz C, Ozkarahan I (2013) Parallel machine scheduling with additional resources: notation, classification, models and solution methods. Eur J Oper Res 230(3):449–463MathSciNetCrossRefGoogle Scholar
  15. 15.
    Joo CM, Kim BS (2015) Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability. Comput Ind Eng 85:102–109CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.St. Peter’s College of Engineering & TechnologyChennaiIndia
  2. 2.Bharath Institute of Higher Education and ResearchChennaiIndia

Personalised recommendations