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

Designing A Tabu Search Algorithm For The Two-stage Flow Shop Problem With Secondary Criterion

陳春龍, J. Gupta, Nagarajan Palanimuthu, Chuen-Lung Chen
Published 1999 · Mathematics

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 discusses the process of desigining a tabu search-based heuristic for the two-stage flow shop problem with makespan minimization as the primary criterion and the minimization of total flow time as the secondary criterion. A factorial experiment is designed to analyse thoroughly the effects of four different factors, i.e. the initial solution, type of move, size of neighbourhood and the list size, on the performance of the tabu search-based heuristic. Using the techniques of evolution curves, and response tables and response graphs, coupled with the Taguchi method, the best combination of the factors for the tabu search-based heuristic is identified, and the effectiveness of the heuristic algorithm in finding an optimal solution is evaluated by comparing its performance with the best known heuristic to solve this problem.



This paper is referenced by
10.1145/3314527.3314538
Interactive Multi-Objective Optimization Using Mobile Application: Application to Multi-Objective Linear Assignment Problem
Shinmyeong Kim (2019)
10.29121/granthaalayah.v7.i1.2019.1036
JOB SHOP SCHEDULING CONSIDERING MAKESPAN, PENALTIES OF MACHINE IDLING, AND JOB OUT OF TIME
Jaber S. Alzahrani (2019)
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.4028/www.scientific.net/JERA.26.142
Scheduling Problems of Flexible Manufacturing Systems: Review, Classification and Opportunities
Ghita Lebbar (2016)
Applying a utility based fuzzy probabilistic α-cut method to optimize a constrained multi objective model
Mohammadreza Torkjazi (2015)
10.4172/2169-0316.1000147
A Fuzzy Probabilistic Maximum Technique to Optimize an Unconstrained Utility Based Multi Objective Model
Mohammadreza Torkjazi (2015)
10.3233/IFS-130958
Optimizing an unconstrained multi objective model using a utility based fuzzy probabilistic α-cut method
M. Torkjazi (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.3923/JAS.2013.242.251
A Robust Design Approach for GA-based Back Propagation Neural Networks Designed to Classify Data of Different Types
C. Huang (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.1108/09727981211271922
Scheduling of a flexible job‐shop using a multi‐objective genetic algorithm
R. Agrawal (2012)
ON JOB-SHOP AND FLOW-SHOP SCHEDULING USING MULTI CRITERIA DECISION MAKING
S. Parveen (2011)
10.1007/S00170-010-3100-X
A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
J. Arroyo (2011)
10.3329/JME.V41I2.7508
REVIEW ON JOB-SHOP AND FLOW-SHOP SCHEDULING USING
S. Parveen (2010)
10.1016/j.eswa.2009.06.105
A multi-objective ant colony system algorithm for flow shop scheduling problem
Betul Yagmahan (2010)
10.1080/00207540701500486
A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness
M. Braglia (2009)
10.1007/978-3-642-02836-6_9
Scheduling Practice and Recent Developments in Flow Shop and Job Shop Scheduling
Betul Yagmahan (2009)
10.1080/00207540802010823
Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study
A. Alfieri (2009)
10.1016/J.APM.2007.06.009
A bicriteria flowshop scheduling with a learning effect
T. Eren (2008)
10.1287/ijoc.1070.0258
A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
Gerardo Minella (2008)
10.1007/978-3-642-03211-0_15
An Interactive Simulated Annealing Multi-agents Platform to Solve Hierarchical Scheduling Problems with Goals
S. Dhouib (2008)
10.1016/j.datak.2008.04.010
Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries
F. Lin (2008)
10.1007/s10479-007-0175-3
Counting and enumeration complexity with application to multicriteria scheduling
V. T'kindt (2007)
10.1007/s00291-006-0071-2
Two heuristics for the one-dimensional bin-packing problem
A. Singh (2007)
10.1007/s10589-007-9018-z
A local search using solution fragments for the 2-machine bicriteria scheduling problem
Gaofeng Huang (2007)
SIRA-BAĞIMLI HAZIRLIK ZAMANLI İKİ ÖLÇÜTLÜ ÇİZELGELEME PROBLEMİ: TOPLAM TAMAMLANMA ZAMANI VE MAKSİMUM ERKEN BİTİRME / A BICRITERIA SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES: TOTAL COMPLETION TIMES AND MAXIMUM EARLINESS
T. Eren (2007)
10.1016/j.ejor.2004.07.017
Genetic local search for multi-objective flowshop scheduling problems
J. Arroyo (2005)
10.1007/s10288-005-0063-0
Counting and enumeration complexity with application to multicriteria scheduling
V. T'Kindt (2005)
10.1016/j.ejor.2004.07.010
Multicriteria scheduling
V. T'Kindt (2005)
A Simple Yet Effective Framework for Optimization Problems
Gaofeng Huang (2004)
ÇOK ÖLÇÜTLÜ AKIŞ TİPİ ÇİZELGELEME PROBLEMLERİ İÇİN BİR LİTERATÜR TARAMASI
T. Eren (2004)
See more
Semantic Scholar Logo Some data provided by SemanticScholar