Online citations, reference lists, and bibliographies.
← Back to Search

Local Search Heuristics For Two-stage Flow Shop Problems With Secondary Criterion

J. Gupta, Karsten Hennig, Frank Werner
Published 2002 · Mathematics, Computer Science

Save to my Library
Download PDF
Analyze on Scholarcy Visualize in Litmaps
Share
Reduce the time it takes to create your bibliography by a factor of 10 by using the world’s favourite reference manager
Time to take this seriously.
Get Citationsy
This paper develops and compares different local search heuristics for the two-stage flow shop problem with makespan minimization as the primary criterion and the minimization of either the total flow time, total weighted flow time, or total weighted tardiness as the secondary criterion. We investigate several variants of simulated annealing, threshold accepting, tabu search, and multi-level search algorithms. The influence of the parameters of these heuristics and the starting solution are empirically analyzed. The proposed heuristic algorithms are empirically evaluated and found to be relatively more effective in finding better quality solutions than the existing algorithms.
This paper references
10.1063/1.1699114
Equation of state calculations by fast computing machines
N. Metropolis (1953)
10.1002/NAV.3800010110
Optimal two- and three-stage production schedules with setup times included
S. Johnson (1954)
10.1007/978-3-642-80784-8_2
Sequencing Research and the Industrial Scheduling Problem
S. Panwalkar (1973)
10.1287/moor.1.2.117
The Complexity of Flowshop and Jobshop Scheduling
M. Garey (1976)
10.1126/science.220.4598.671
Optimization by Simulated Annealing
S. Kirkpatrick (1983)
Thermodynamical approach to the traveling salesman problem
ČernýV. (1985)
10.1007/BF00940812
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
V. Cerny (1985)
10.1007/BF01582166
Convergence of an annealing algorithm
M. Lundy (1986)
10.1016/0305-0483(88)90008-4
Bicriterion static scheduling research for a single machine
P. Dileepan (1988)
10.1287/MNSC.34.3.391
The Shifting Bottleneck Procedure for Job Shop Scheduling
J. Adams (1988)
10.1016/0305-0483(89)90063-7
A framework for single machine multiple objective sequencing research
T. Fry (1989)
10.1016/0377-2217(89)90383-4
A new heuristic method for the flow shop sequencing problem
M. Widmer (1989)
10.1287/ijoc.1.3.190
Tabu Search - Part I
Fred W. Glover (1989)
Sequencing and scheduling: algorithms and complexity
E. Lawler (1989)
10.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H
Multiobjective flow-shop scheduling
R. Daniels (1990)
10.1287/ijoc.2.1.4
Tabu Search - Part II
F. Glover (1990)
10.1016/0377-2217(90)90090-X
Some efficient heuristic methods for the flow shop sequencing problem
É. Taillard (1990)
10.1016/0021-9991(90)90201-B
Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal
G. W. Dueck (1990)
10.1057/JORS.1991.9
Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach
M. Widmer (1991)
10.1016/0167-6377(92)90028-2
Large-step markov chains for the TSP incorporating local search heuristics
O. Martin (1992)
10.1057/JORS.1992.126
Two-Stage Flowshop Scheduling Problem with Bicriteria
C. Rajendran (1992)
Single-machine bicriteria scheduling
J. Hoogeveen (1992)
Large-step Markov chain for the TSP incorporating local search heuristics. Operations Research Letters 1992;11:219}24
O Martin (1992)
Sequencing and Scheduling: Algorithms and Complexity, in Logistics of production and inventory
E. Lawler (1993)
10.1142/9789814354363_0013
Complexity of Single Machine Hierarchical Scheduling: A Survey
Chung-Yee Lee (1993)
Modern heuristic techniques for combinatorial problems
C. Reeves (1993)
10.1057/JORS.1993.3
Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
Y. Kim (1993)
10.1080/07408179308964284
SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH
J. Barnes (1993)
Complexity results for multi-machine multi-criteria scheduling problems
CL Chen (1994)
10.1016/0377-2217(93)E0140-S
Multiple and bicriteria scheduling : A literature survey
Amit Nagar (1995)
10.1016/0377-2217(95)00012-F
Job-shop scheduling: Computational study of local search and large-step optimization methods
H. R. Lourenço (1995)
10.1007/BF01539731
Heuristics for permutation flow shop scheduling with batch setup times
Yuri N. Sotskov (1996)
10.1007/BF02156631
A comparison of local search methods for flow shop scheduling
C. A. Glass (1996)
10.1016/0377-2217(95)00275-8
Genetic algorithms for the two-stage bicriteria flowshop problem
Venkata Ranga Neppalli (1996)
10.1016/0166-218x(95)00030-u
Improving Local Search Heuristics for Some Scheduling Problems-I
P. Brucker (1996)
10.1016/S0166-218X(96)00036-4
Improving Local Search Heuristics for some Scheduling Problems. Part II
P. Brucker (1997)
10.1016/S0895-7177(99)00085-0
A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
D. Danneberg (1999)
10.1080/095372899233217
Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion
陳春龍 (1999)
Designing a tabu search algorithm for the two-stage #owshop problem with secondary criterion. Production Planning and Control: An International Journal 1999;10:251}65
JND Gupta (1999)
10.1016/S0925-5273(00)00039-6
Minimizing total flow time in a two-machine flowshop problem with minimum makespan
Jatinder N. D. Gupta (2001)
Minimizing total # ow time in a 2 - machine # owshop problem with minimum makespan
Gupta JND (2001)



This paper is referenced by
10.1088/1742-6596/1818/1/012042
Exact and Hybrid Metaheuristic Algorithms to Solve Bi-Objective Permutation Flow Shop Scheduling Problem
Hafed M. Motair (2021)
10.1016/J.PROCS.2021.01.332
Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system
M. Gutjahr (2021)
10.1111/itor.12760
Dispatching problems for parallel machines in the TFT-LCD assembly process
Jyh-Wen Ho (2021)
10.1177/1687814019843699
A novel fuzzy model for multi-objective permutation flow shop scheduling problem with fuzzy processing time
Fuyu Yuan (2019)
10.1007/s00521-018-3368-6
An efficient simulation–neural network–genetic algorithm for flexible flow shops with sequence-dependent setup times, job deterioration and learning effects
A. Azadeh (2018)
10.18081/2226-3284/018-4/36-47
On the Two Machine Permutation Flowshop Scheduling Problems Using Variable Neighborhood Search Algorithms
T. A. Razaq (2018)
10.1201/9781315152394-4
Complexity and Algorithms
M. Schaefer (2018)
10.1007/s10479-018-2775-5
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
Emna Dhouib (2018)
Using Two Stage Hybrid Algorithm for Solving Flow-Shop Scheduling Problem
A. Kadhem (2017)
Modeling and Scheduling of Multi-Stage and Multi-Processor Flow Shop
H. Paul (2017)
10.5267/j.ijiec.2015.8.001
Flow shop scheduling algorithm to optimize warehouse activities
Piera Centobelli (2016)
10.1051/MATECCONF/20168201017
Local Search Optimization for a Multi-state Series-parallel System
Mingang Yin (2016)
10.4028/www.scientific.net/JERA.26.142
Scheduling Problems of Flexible Manufacturing Systems: Review, Classification and Opportunities
Ghita Lebbar (2016)
FUZZY MUL T1 OBJECTIVE MACHINE RELIABILITY BASED HYBRID FLOW SHOP SCHEDULING
Tahmtna Ferdousi Lipi (2015)
Applying a utility based fuzzy probabilistic α-cut method to optimize a constrained multi objective model
Mohammadreza Torkjazi (2015)
10.1007/978-981-13-1799-6_20
A Multiobjective Genetic Algorithm for Hybrid Flow Shop of a Harddisk Drive's Manufacturer
Wanida Laoraksakiat (2015)
10.4172/2169-0316.1000147
A Fuzzy Probabilistic Maximum Technique to Optimize an Unconstrained Utility Based Multi Objective Model
Mohammadreza Torkjazi (2015)
10.1109/TEM.2015.2453264
Multiobjective Local Search Algorithm-Based Decomposition for Multiobjective Permutation Flow Shop Scheduling Problem
X. Li (2015)
A Heuristic Approach to the Daily Delivery Scheduling Problem. Case Study: Alcohol Products Delivery Scheduling within Intra-Community Trade Legislation
Mariusz Grajek (2014)
10.3233/IFS-130958
Optimizing an unconstrained multi objective model using a utility based fuzzy probabilistic α-cut method
M. Torkjazi (2014)
10.1016/J.SBSPRO.2014.01.109
MCDM Approach to the Excise Goods Daily Delivery Scheduling Problem. Case Study: Alcohol Products Delivery Scheduling under Intra-community Trade Regulations
Mariusz Grajek (2014)
Three metaheuristics to solve the no-wait two-stage assembly ow-shop scheduling problem
A. Mozdgir (2014)
10.1016/J.OMEGA.2013.07.004
Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends
M. M. Yenisey (2014)
10.1002/9781118731598.CH4
A Comparison of Local Search Metaheuristics for a Hierarchical Flow Shop Optimization Problem with Time Lags
Emna Dhouib (2013)
10.1111/j.1475-3995.2012.00876.x
Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
Emna Dhouib (2013)
10.1007/S00170-013-5187-3
Two-stage flow-shop scheduling problem with non-identical second stage assembly machines
J. Navaei (2013)
10.1007/978-3-642-40047-6_31
MROrder: Flexible Job Ordering Optimization for Online MapReduce Workloads
Shanjiang Tang (2013)
10.1016/J.APM.2012.06.012
Order acceptance/rejection policies in determining the sequence in mixed model assembly lines
N. Manavizadeh (2013)
A Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times
Tavakkoli-Moghaddam (2012)
10.1109/ICM.2011.219
Review on Hybrid Flow Shop Scheduling
Wenpeng Wang (2011)
10.1007/S00170-010-3094-4
Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects
Yi Sun (2011)
ON JOB-SHOP AND FLOW-SHOP SCHEDULING USING MULTI CRITERIA DECISION MAKING
S. Parveen (2011)
See more
Semantic Scholar Logo Some data provided by SemanticScholar