Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends

MM Yenisey, B Yagmahan - Omega, 2014 - Elsevier
The flow shop scheduling problem is finding a sequence given n jobs with same order at m
machines according to certain performance measure (s). The job can be processed on at …

Flowshop-scheduling problems with makespan criterion: a review

S Reza Hejazi*, S Saghafian - International Journal of Production …, 2005 - Taylor & Francis
This paper is a complete survey of flowshop-scheduling problems and contributions from
early works of Johnson of to recent approaches of metaheuristics of 2004. It mainly …

[图书][B] Multicriteria scheduling: theory, models and algorithms

V T'kindt, JC Billaut - 2006 - books.google.com
Scheduling and multicriteria optimisation theory have been subject, separately, to numerous
studies. Since the last twenty years, multicriteria scheduling problems have been subject to …

Multicriteria scheduling

H Hoogeveen - European Journal of operational research, 2005 - Elsevier
In this paper we give a survey of the most important results on multicriteria scheduling that
have appeared in the literature or are to appear. We provide an extensive introduction …

Bicriteria train scheduling for high-speed passenger railroad planning applications

X Zhou, M Zhong - European Journal of Operational Research, 2005 - Elsevier
This paper is concerned with a double-track train scheduling problem for planning
applications with multiple objectives. Focusing on a high-speed passenger rail line in an …

A review and evaluation of multiobjective algorithms for the flowshop scheduling problem

G Minella, R Ruiz, M Ciavotta - INFORMS Journal on …, 2008 - pubsonline.informs.org
This paper contains a complete and updated review of the literature for multiobjective
flowshop problems, which are among the most studied environments in the scheduling …

An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem

V T'kindt, N Monmarché, F Tercinet, D Laügt - European Journal of …, 2002 - Elsevier
Consider the 2-machine flowshop scheduling problem with the objective of minimizing both
the total completion time and the makespan criteria. The latter is assumed to be optimized …

A multi-objective ant colony system algorithm for flow shop scheduling problem

B Yagmahan, MM Yenisey - Expert Systems with Applications, 2010 - Elsevier
In this paper, we consider the flow shop scheduling problem with respect to the both
objectives of makespan and total flowtime. This problem is known to be NP-hard type in …

Dynamic Programming algorithms and their applications in machine scheduling: A review

EAG de Souza, MS Nagano, GA Rolim - Expert Systems with Applications, 2022 - Elsevier
This paper aims at presenting a compilation of state-of art references in which dynamic
programming (DP) and its variants have been applied as a solution methods for the …

A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem

CP Tomazella, MS Nagano - Expert Systems with Applications, 2020 - Elsevier
This article is a comprehensive review of Branch-and-Bound algorithms for solving flowshop
scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and …