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 …
machines according to certain performance measure (s). The job can be processed on at …
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 …
scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and …
Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem
The sum of the maximum earliness and tardiness criteria is a new objective function for the
job shop scheduling problem introduced in this work. A mixed integer linear programming …
job shop scheduling problem introduced in this work. A mixed integer linear programming …
A single-machine scheduling problem with multiple unavailability constraints: A mathematical model and an enhanced variable neighborhood search approach
M Yazdani, SM Khalili… - Journal of …, 2017 - academic.oup.com
This research focuses on a scheduling problem with multiple unavailability periods and
distinct due dates. The objective is to minimize the sum of maximum earliness and tardiness …
distinct due dates. The objective is to minimize the sum of maximum earliness and tardiness …
Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
We consider the problem of scheduling a set of jobs on a single machine against a common
and restrictive due date. In particular, we are interested in the problem of minimizing the …
and restrictive due date. In particular, we are interested in the problem of minimizing the …
Optimizing blocking flow shop scheduling problem with total completion time criterion
G Moslehi, D Khorasanian - Computers & Operations Research, 2013 - Elsevier
The blocking flow shop scheduling problem has found many applications in manufacturing
systems. There are a few exact methods for solving this problem with different criteria. In this …
systems. There are a few exact methods for solving this problem with different criteria. In this …
An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop
R M'hallah - International Journal of Production Research, 2014 - Taylor & Francis
This paper considers the minimal earliness tardiness-machine permutation flow shop
scheduling problem with distinct due dates and no inserted idle time when a job is waiting. It …
scheduling problem with distinct due dates and no inserted idle time when a job is waiting. It …
Group scheduling and due date assignment on a single machine
S Li, CT Ng, J Yuan - International Journal of Production Economics, 2011 - Elsevier
We consider a single-machine scheduling problem involving both the due date assignment
and job scheduling under a group technology environment. The jobs (orders) of customers …
and job scheduling under a group technology environment. The jobs (orders) of customers …
A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness
J Schaller, JMS Valente - International Journal of Production …, 2013 - Taylor & Francis
This paper considers the problem of scheduling jobs in a permutation flow shop with the
objective of minimising total earliness and tardiness. A genetic algorithm is proposed for the …
objective of minimising total earliness and tardiness. A genetic algorithm is proposed for the …
Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed
J Schaller, JMS Valente - Expert Systems with Applications, 2019 - Elsevier
This paper considers the problem of scheduling jobs in a permutation flow shop with the
objective of minimizing total earliness and tardiness. Unforced idle time is considered in …
objective of minimizing total earliness and tardiness. Unforced idle time is considered in …