article

Some local search algorithms for no-wait flow-shop problem with makespan criterion

Authors:

Józef Grabowski,

Jarosław PemperaAuthors Info & Claims

Computers and Operations Research, Volume 32, Issue 8

Pages 2197 - 2212

https://doi.org/10.1016/j.cor.2004.02.009

Published: 01 August 2005 Publication History

Abstract

This paper develops and compares different local search algorithms for the no-wait flow-shop problem with makespan criterion (C_max). We present several variants of descending search and tabu search algorithms. In the algorithms the multimoves are used that consist in performing several moves simultaneously in a single iteration of algorithm and allow us to accelerate the convergence to good solutions. Besides, in the tabu search algorithms a dynamic tabu list is proposed that assists additionally to avoid trapped at a local optimum. The proposed algorithms are empirically evaluated and found to be relatively more effective in finding better quality solutions than existing algorithms. The presented ideas can be applied in any local search procedures.

References

[1]

{1} Wismer DA. Solution of the flowshop-scheduling with no intermediate queues. Operations Research 1972;20: 689-97.

[2]

{2} Hall NG, Sriskandarayah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 1996;44:510-25.

[3]

{3} Rajendran C. A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society 1994;45:472-8.

[4]

{4} Raaymakers W, Hoogeveen J. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research 2000;126:131-51.

[5]

{5} Grabowski J, Pempera J. Sequencing of jobs in some production system. European Journal of Operational Research 2000;125:535-50.

[6]

{6} Reddi SS, Ramamoorthy CV. On the flowshop sequencing problem with no-wait in process. Operational Research Quarterly 1972;23:323-31.

[7]

{7} Grabowski J, Syslo M. On some machine Sequencing problems (I). Applications of Mathematicae 1973;13:340-5.

[8]

{8} Bonney MC, Gundry SW. Solutions to the constrained flowshop sequencing problem. Operational Research Quarterly 1976;24:869-83.

[9]

{9} King JR, Spachis AS. Heuristics for flowshop scheduling. International Journal of Production Research 1980;18: 343-57.

[10]

{10} Gangadharan R, Rajedran C. Heuristic algorithms for scheduling in no-wait flowshop. International Journal of Production Economics 1993;32:285-90.

[11]

{11} Glass CA, Gupta JND, Potts CN. Two-machine no-wait flow shop scheduling with missing operations. Mathematics of Operations Research 1999;24(4):911-24.

[12]

{12} Sidney JB, Potts CN, Sriskandarayah C. Heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. Operations Research Letters 2000;26(4):165-73.

[13]

{13} Svirenko M. Makespan minimization in no-wait flow shops: A polynomial time approximation scheme. SIAM Journal on Discrete Mathematics 2003;16(2):313-22.

[14]

{14} Aldowaisan T, Allahverdi A. New heuristics for no-wait flowshops to minimize makespan. Computers and Operations Research 2003;30:1219-31.

[15]

{15} Schuster CJ, Framinan JM. Approximative procedures for no-wait job shop scheduling. Operations Research Letters 2003;31:308-18.

[16]

{16} Gilmore PC, Lawler EL, Shmoys DB. Well-solved special cases. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB, editors. The traveling salesman problem: a guided tour of combinatorial optimization. Chichester: Wiley; 1985. p. 87-143.

[17]

{17} Gilmore PC, Gomory RE. Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. Operations Research 1964;12:655-79.

[18]

{18} Grabowski J, Pempera J. New block properties for the permutation flow-shop problem with application in TS. Journal of the Operational Research Society 2001;52:210-20.

[19]

{19} Glover F. Tabu search. Part I. ORSA Journal of Computing 1989;1:190-206.

[20]

{20} Glover F. Tabu search. Part II. ORSA Journal of Computing 1990;2:4-32.

[21]

{21} Grabowski J, Wodecki M. A very fast tabu search algorithm for the job shop problem. In: Rego C, Alidaee B, editors. Adaptive memory and evolution; tabu search and scatter search. Dordrecht: Kluwer Academic Publishers, 2004; in print.

[22]

{22} Grabowski J, Wodecki M. A very fast tabu search algorithm for the flow shop problem with makespan criterion. Computers and Operations Research 2004;11:1891-909.

[23]

{23} Nawaz M, Enscore E, Ham I. A Heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA The International Journal of Management Science 1983;11:91-5.

[24]

{24} Carlier J. Ordonnancements a Contraintes Disjonctives. RAIRO Recherche Operationnelle 1978;12:333-51.

[25]

{25} Heller J. Some numerical experiments for an M × J flow shop and its decision-theoretical aspects. Operations Research 1960;8:178-84.

[26]

{26} Reeves CR. A Genetic algorithm for flow shop sequencing. Computers and Operations Research 1995;22:5-13.

[27]

{27} Dongarra JJ. Performance of various computers using standard linear equations software. Working paper. Computer Science Department, University of Tennessee, USA, 2001. http://www.netlib.org/benchmark/performance.ps.

Cited By

Lai RGao BLin W(2021)Solving No-Wait Flow Shop Scheduling Problem Based on Discrete Wolf Pack AlgorithmScientific Programming10.1155/2021/47310122021Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1155/2021/4731012
Miyata HNagano MGupta J(2019)Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimizationComputers and Industrial Engineering10.1016/j.cie.2019.05.034135:C(79-104)Online publication date: 1-Sep-2019
https://dl.acm.org/doi/10.1016/j.cie.2019.05.034
Cheng CYing KLi SHsieh Y(2019)Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup timesComputers and Industrial Engineering10.1016/j.cie.2019.02.041130:C(338-347)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1016/j.cie.2019.02.041
Show More Cited By

Index Terms

Some local search algorithms for no-wait flow-shop problem with makespan criterion

Recommendations

Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms

Three variants of IG algorithms are presented based on VNS, VND, RNS to solve the distributed no-wait flow shop scheduling problem (DNWFSP).An improved NEH heuristic is proposed to generate a promising initial solution.Four local search methods based on ...
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion

This paper deals with a classic flow-shop scheduling problem with makespan criterion. Some new properties of the problem associated with the blocks have been presented and discussed, These properties allow us to propose a new very fast local search ...
Local search algorithms for the k-cardinality tree problem

In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for efficient methods to obtain good solutions. We review ...

Comments

Information & Contributors

Information

Published In

cover image Computers and Operations Research

Computers and Operations Research Volume 32, Issue 8

August 2005

263 pages

ISSN:0305-0548

Issue’s Table of Contents

Publisher

Elsevier Science Ltd.

United Kingdom

Publication History

Published: 01 August 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lai RGao BLin W(2021)Solving No-Wait Flow Shop Scheduling Problem Based on Discrete Wolf Pack AlgorithmScientific Programming10.1155/2021/47310122021Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1155/2021/4731012
Miyata HNagano MGupta J(2019)Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimizationComputers and Industrial Engineering10.1016/j.cie.2019.05.034135:C(79-104)Online publication date: 1-Sep-2019
https://dl.acm.org/doi/10.1016/j.cie.2019.05.034
Cheng CYing KLi SHsieh Y(2019)Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup timesComputers and Industrial Engineering10.1016/j.cie.2019.02.041130:C(338-347)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1016/j.cie.2019.02.041
Qu CFu YYi ZTan J(2018)Solutions to No-Wait Flow Shop Scheduling Problem Using the Flower Pollination Algorithm Based on the Hormone Modulation MechanismComplexity10.1155/2018/19736042018Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1155/2018/1973604
Ye HLi WAbedini ANault B(2017)An effective and efficient heuristic for no-wait flow shop production to minimize total completion timeComputers and Industrial Engineering10.1016/j.cie.2017.04.002108:C(57-69)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1016/j.cie.2017.04.002
Komaki GTeymourian EKayvanfar VBooyavi Z(2017)Improved discrete cuckoo optimization algorithm for the three-stage assembly flowshop scheduling problemComputers and Industrial Engineering10.1016/j.cie.2017.01.006105:C(158-173)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1016/j.cie.2017.01.006
Lin SYing K(2016)Minimizing makespan for solving the distributed no-wait flowshop scheduling problemComputers and Industrial Engineering10.1016/j.cie.2016.07.02799:C(202-209)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1016/j.cie.2016.07.027
Laha DGupta J(2016)A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shopsComputers and Industrial Engineering10.1016/j.cie.2016.06.00398:C(373-383)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1016/j.cie.2016.06.003
Mokhtari H(2016)Research on group search optimizers for a reconfigurable flow shop sequencing problemNeural Computing and Applications10.1007/s00521-015-1963-327:6(1657-1667)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1007/s00521-015-1963-3
Ding JSong SGupta JZhang RChiong RWu C(2015)An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problemApplied Soft Computing10.1016/j.asoc.2015.02.00630:C(604-613)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.asoc.2015.02.006
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents