Online citations, reference lists, and bibliographies.

A Comparison Of Local Search Metaheuristics For A Hierarchical Flow Shop Optimization Problem With Time Lags

Emna Dhouib, J. Teghem, D. Tuyttens, Taicir Loukil
Published 2013 · Mathematics

Cite This
Download PDF
Analyze on Scholarcy
Share
This paper references
10.1057/jors.1985.160
A Microcomputer Based Solution to a Practical Scheduling Problem
A. Hodson (1985)
10.1016/0377-2217(89)90107-0
Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave
G. Laporte (1989)
10.1016/J.OMEGA.2007.01.003
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
D. Ronconi (2009)
10.1016/j.cor.2004.11.006
Permutation flowshop scheduling problems with maximal and minimal time lags
Julien Fondrevelle (2006)
10.1057/jors.1992.126
Two-Stage Flowshop Scheduling Problem with Bicriteria
C. Rajendran (1992)
10.1016/0167-6377(89)90002-3
A probabilistic heuristic for a computationally difficult set covering problem
T. Feo (1989)
10.1109/70.544767
Single machine scheduling with chain: structured precedence constraints and separation time windows
Chengbin Chu (1996)
10.1016/j.cor.2009.06.006
Using a greedy random adaptative search procedure to solve the cover printing problem
Daniel Tuyttens (2010)
10.1016/S0167-5060(08)70743-X
Complexity of machine scheduling problems
P. Brucker (1975)
10.1016/0377-2217(93)E0140-S
Multiple and bicriteria scheduling: A literature survey
Amit Nagar (1995)
10.1007/s10852-012-9180-x
Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints
Emna Dhouib (2013)
10.1016/0360-8352(94)00026-J
A two-machine flowshop sequencing problem with limited waiting time constraints
D. Yang (1995)
10.1080/095372899233217
Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion
陳春龍 (1999)
10.1016/0377-2217(89)90108-2
A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
A. Hariri (1989)
10.1080/00207540802320164
Permutation flow shops with exact time lags to minimise maximum lateness
Julien Fondrevelle (2009)
10.1057/palgrave.jors.2602598
A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
B.-J. Joo (2009)
10.1051/ro:2001109
Multicriteria scheduling problems: a survey
V. T'Kindt (2001)
10.1126/science.220.4598.671
Optimization by Simulated Annealing
S. Kirkpatrick (1983)
10.1287/opre.44.5.777
Shop Problems With Two Machines and Time Lags
M. Dell'Amico (1996)
10.1016/S0305-0548(00)00061-7
Local search heuristics for two-stage flow shop problems with secondary criterion
Jatinder N. D. Gupta (2002)
10.1016/0377-2217(95)00275-8
Genetic algorithms for the two-stage bicriteria flowshop problem
Venkata Ranga Neppalli (1996)
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.1016/S0305-0548(02)00021-7
Two-machine flowshop scheduling with a secondary criterion
V. T'Kindt (2003)



This paper is referenced by
Semantic Scholar Logo Some data provided by SemanticScholar