A TLBO and a Jaya heuristics for permutation flow shop scheduling to minimize the sum of inventory holding and batch delay costs

Abstract This paper deals with permutation flow shop scheduling problem in which an integrated cost model consisting of work-in-process inventory carrying cost and penalty cost due to batch delay is proposed. The objective is to obtain an optimum production schedule which minimizes the expected total cost per unit time of scheduling. To optimize the objective function, we apply two new metaheuristic optimization techniques namely TLBO (teaching-learning based optimization) and Jaya and two traditional algorithms: PSO (particle swarm optimization) and SA (simulated annealing). The problem is solved for several instances ranging from 8 jobs and 5 machines to 500 jobs and 20 machines. Computational results show that for small instances, all algorithms performed equally good when compared with the exact solution (total enumeration method). However, for medium and large size problems, enumeration method was unable to give the results in a reasonable computation time period. Therefore the results of all four algorithms are compared among themselves and found that Jaya outperforms all algorithms. However, for a few large instances, SA yields better results in less computation time as against other heuristics. The overall performance of all algorithms reveals that TLBO and Jaya have considerable potential to solve discrete combinatorial problems such as permutation flow-shop scheduling problems.

[1]  Fardin Ahmadizar,et al.  Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs , 2015, Comput. Oper. Res..

[2]  Dong-Ho Lee,et al.  A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs , 2011, Comput. Ind. Eng..

[3]  Fariborz Jolai,et al.  Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs , 2014, Comput. Oper. Res..

[4]  Bilal Toklu,et al.  Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect , 2012 .

[5]  George Steiner,et al.  Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs , 2009, Oper. Res..

[6]  Quan-Ke Pan,et al.  A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems , 2015, Eng. Appl. Artif. Intell..

[7]  R. Venkata Rao,et al.  Review of applications of TLBO algorithm and a tutorial for beginners to solve the unconstrained and constrained optimization problems , 2016 .

[8]  Philip M. Kaminsky,et al.  Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs , 2004 .

[9]  Chung Yee Lee,et al.  On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date , 1993 .

[10]  Xinyu Shao,et al.  An effective hybrid teaching-learning-based optimization algorithm for permutation flow shop scheduling problem , 2014, Adv. Eng. Softw..

[11]  Abdul Hakim Halim,et al.  Integrated batch production and maintenance scheduling for multiple items processed on a deteriorating machine to minimize total production and maintenance costs with due date constraint , 2016 .

[12]  Jan Taler,et al.  Dimensional optimization of a micro-channel heat sink using Jaya algorithm , 2016 .

[13]  Gopal Agarwal,et al.  Meta-heuristic approaches for flowshop scheduling problems: a review , 2016, Int. J. Adv. Oper. Manag..

[14]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[15]  Yeong-Dae Kim,et al.  A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints , 2000, Eur. J. Oper. Res..

[16]  Amir Ebrahimzadeh Pilerood,et al.  Single-machine batch scheduling minimizing weighted flow times and delivery costs with job release times , 2012 .

[17]  R. Rao,et al.  Multi-objective optimization of heat exchangers using a modified teaching-learning-based optimization algorithm , 2013 .

[18]  Ji-Bo Wang,et al.  Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties , 2011, Appl. Math. Comput..

[19]  Herbert Meyr,et al.  Multi-stage simultaneous lot-sizing and scheduling for flow line production , 2013, OR Spectr..

[20]  Jun He,et al.  A binary branch and bound algorithm to minimize maximum scheduling cost , 2014 .

[21]  Débora P. Ronconi,et al.  Minimizing earliness and tardiness penalties in a single-machine problem with a common due date , 2005, Eur. J. Oper. Res..

[22]  R. Venkata Rao,et al.  Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems , 2011, Comput. Aided Des..

[23]  Divya Pandey,et al.  Joint consideration of production scheduling, maintenance and quality policies: a review and conceptual framework , 2010, Int. J. Adv. Oper. Manag..

[24]  Divya Pandey,et al.  A methodology for joint optimization for maintenance planning, process quality and production scheduling , 2011, Comput. Ind. Eng..

[25]  T. C. Edwin Cheng,et al.  Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost , 2012, Comput. Ind. Eng..

[26]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[27]  Gur Mosheiov,et al.  Heuristics for multimachine scheduling problems with earliness and tardiness costs , 1996 .

[28]  Ik Sun Lee,et al.  Coordinated scheduling of production and delivery stages with stage-dependent inventory holding costs , 2010 .

[29]  R. Rao.  Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems , 2016 .

[30]  Ruhul A. Sarker,et al.  A genetic algorithm for permutation flow shop scheduling under make to stock production system , 2015, Comput. Ind. Eng..

[31]  Mohammad Rostami,et al.  A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs , 2014 .

[32]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[33]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[34]  Alper Hamzadayi,et al.  Testing the performance of teaching-learning based optimization (TLBO) algorithm on combinatorial problems: Flow shop and job shop scheduling cases , 2014, Inf. Sci..

[35]  R. Venkata Rao,et al.  Economic optimization of shell-and-tube heat exchanger using Jaya algorithm with maintenance consideration , 2017 .

[36]  Payman Dehghanian,et al.  Practical multi-area bi-objective environmental economic dispatch equipped with a hybrid gradient search method and improved Jaya algorithm , 2016 .

[37]  Andrew Junfang Yu,et al.  Minimizing tardiness and maintenance costs in flow shop scheduling by a lower-bound-based GA , 2016, Comput. Ind. Eng..

[38]  Joseph Y.-T. Leung,et al.  Integrated scheduling on a batch machine to minimize production, inventory and distribution costs , 2017, Eur. J. Oper. Res..