Related references
Note: Only part of the references are listed.A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Ruben Ruiz et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness
JM Framinan et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2006)
A comprehensive review and evaluation of permutation flowshop heuristics
R Ruiz et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)
Flowshop-scheduling problems with makespan criterion: a review
SR Hejazi et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2005)
Scheduling in flowshops to minimize total tardiness of jobs
S Hasija et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2004)
Approximative procedures for no-wait job shop scheduling
CJ Schuster et al.
OPERATIONS RESEARCH LETTERS (2003)
Variable neighborhood search: Principles and applications
P Hansen et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2001)