Abstract
This paper presents several procedures for developing non-delay schedules for a permutation flow shop with family setups when the objective is to minimize total earliness and tardiness. These procedures consist of heuristics that were found to be effective for minimizing total tardiness in flow shops without family setups, modified to consider family setups and the total earliness and tardiness objective. These procedures are tested on several problem sets with varying conditions. The results show that variable greedy algorithms are effective when solving small problems, but using a genetic algorithm that includes a neighbourhood defined by the sequence of batches of jobs belonging to the same set-up family is effective when solving medium- or large-sized problems. The results also show that if setup times can be reduced a significant reduction in total earliness and tardiness could result.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baker KR and Scudder GD (1990). Sequencing with earliness and tardiness penalties: A review. Operations Research 38 (1): 22–36.
Chandra P, Mehta P and Tirupati D (2009). Permutation flow shop scheduling with earliness and tardiness penalties. International Journal of Production Research 47 (20): 5591–5610.
Cheng TCE, Gupta JND and Wang G (2000). A review of flowshop scheduling research with setup times. Production and Operations Management 9 (3): 262–282.
Framinan JM and Leisten R (2008). Total tardiness minimization in permutation flowshops: A simple approach based on a variable greedy algorithm. International Journal of Production Research 46 (22): 6479–6498.
Hasija S and Rajendran C (2004). Scheduling in flowshops to minimize total tardiness of jobs. International Journal of Production Research 42 (11): 2289–2301.
Hoogeveen H (2005). Multicriteria scheduling. European Journal of Operational Research 167 (3): 592–623.
Jorden C (1996). Batching and Scheduling: Models and Methods for Several Problem Classes. Springer: Berlin, Germany.
Kanet JJ and Sridharan V (2000). Scheduling with inserted idle time: Problem taxonomy and literature review. Operations Research 48 (1): 99–110.
Kim Y (1993). Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of the Operational Research Society 44 (1): 19–28.
Kim Y, Lim HG and Park MW (1996). Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process. European Journal of the Operational Research 91 (1): 124–143.
Korman K (1994). A pressing matter. Video February: 46–50.
Landis K (1993). Group technology and cellular manufacturing in the Westvaco Los Angeles VH Department. Project report in IOM 581, School of Business, University of Southern California.
Madhushini N, Rajendran C and Deepa Y (2009). Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs. Journal of the Operational Research Society 60 (7): 991–1004.
Moslehi G, Mirzaee M, Vasei M and Azaron A (2009). Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness. International Journal of Production Economics 122 (2): 763–773.
Parthasarathy S and Rajendran C (1997). A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs—A case study. Production Planning and Control 8 (5): 475–483.
Schaller JE (2000). A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell. International Journal of Production Research 38 (2): 287–308.
Shingo S (1985). SMED: A Revolution in Manufacturing. Cambridge, MA: Productivity Press.
Valente JMS (2009). Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs. Asia-Pacific Journal of Operational Research 26 (3): 319–339.
Vallada E and Ruiz R (2010). Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega 38 (1/2): 57–67.
Vallada E, Ruiz R and Minella G (2008). Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research 4 (4): 1350.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schaller, J., Valente, J. An evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardiness. J Oper Res Soc 64, 805–816 (2013). https://doi.org/10.1057/jors.2012.94
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2012.94