The Blocking Job Shop is a version of the job shop scheduling problem with no intermediate
buffers, where a job has to wait on a machine until being processed on the next machine …

This paper provides an analysis of the efficacy of a known iterative improvement meta-
heuristic approach from the AI area in solving the Blocking Job Shop Scheduling Problem …

In this paper, we study the job shop scheduling problem with blocking where the objective is
to minimise the maximum completion time (ie makespan). To solve this non-polynomial-hard …

In this paper, we deal with the resolution of the scheduling problem with blocking which is
known to be non-polynomial-hard. The nature of the workshop defines the type of issue to …

This paper introduces a Petri net-based approach for scheduling manufacturing systems
with blocking. The modelling of the job routings and the resource and blocking constraints is …

In this paper, we consider hybrid flow shop (HFS) scheduling problem with a special
blocking constraint. Objective function is makespan minimization. HFS and RCb blocking …

Railway scheduling problems are quite popular scheduling and optimization problems
which are treated in a large variety of papers and projects. Many special and even quite …

Storage or buffer capacities between successive machines in flowshop problems may be
unlimited, limited or null. Two last cases can lead to blocking situations. In flowshop …

Decision making for complex systems is based on multi-criterion-optimization. A decision
making support can be applied to find the Pareto solutions. Multi-criterion tabu programming …

In this paper we study the bi-criteria blocking job shop scheduling problem. The objective is
to simultaneously minimize two criteria: the Makespan and the maximum lateness. The …