The blocking flow shop scheduling problem: A comprehensive and conceptual review
This paper presents a literature review on the m-machine flow shop scheduling problem with
blocking conditions. In total, 139 papers are reviewed and classified, ranging from 1969 up …
blocking conditions. In total, 139 papers are reviewed and classified, ranging from 1969 up …
Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
Abstract Mixed Blocking Permutation Flowshop Scheduling Problem (MBPFSP) with the
objective of makespan minimisation is NP-Hard. It has important industrial applications that …
objective of makespan minimisation is NP-Hard. It has important industrial applications that …
On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time
In this paper, we propose a bi-criteria optimization model for a flow shop scheduling problem
with permutation, blocking and sequence dependent setup time. Indeed, these constraints …
with permutation, blocking and sequence dependent setup time. Indeed, these constraints …
Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
Permutation flowshop scheduling problem (PFSP) is a classical NP-Hard combinatorial
optimisation problem. Existing PFSP variants capture different realistic scenarios, but …
optimisation problem. Existing PFSP variants capture different realistic scenarios, but …
Tailoring customer order scheduling search algorithms
Abstract Customer Order Scheduling Problem (COSP) with minimisation of the total
completion time as the objective is NP-Hard. COSP has many applications that include the …
completion time as the objective is NP-Hard. COSP has many applications that include the …
Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
In this work, we study the task of scheduling jobs on a single machine with sequence
dependent family setup times under the goal of minimizing the makespan, that is, the …
dependent family setup times under the goal of minimizing the makespan, that is, the …
Constraint based local search for flowshops with sequence-dependent setup times
Permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-
SDST) and makespan minimisation is NP-hard. It has important practical applications, for …
SDST) and makespan minimisation is NP-hard. It has important practical applications, for …
An adaptive large neighbourhood search algorithm for blocking flowshop scheduling problem with sequence-dependent setup times
F Bagheri, M Kazemi, A Asef-Vaziri… - International …, 2024 - inderscienceonline.com
Flowshop scheduling problem (FSP) belongs to the classical combinatorial optimisation
problem and takes different forms under different production conditions. To make the …
problem and takes different forms under different production conditions. To make the …
Constraint-guided local search for single mixed-operation runway
Aircraft sequencing problem (ASP) is to schedule the operation times of departing and
arriving aircraft such that their deviation from the desired operation times are minimised …
arriving aircraft such that their deviation from the desired operation times are minimised …
Makespan preserving flowshop reengineering via blocking constraints
Blocking constraints are ubiquitous in machine scheduling. In a flowshop scenario, a
machine might get blocked by a job that has just been processed by the same machine. This …
machine might get blocked by a job that has just been processed by the same machine. This …