The scheduling of flow shops with multiple parallel machines per stage, usually referred to
as the hybrid flow shop (HFS), is a complex combinatorial problem encountered in many …

Abstract Hybrid Flowshop Scheduling Problems (HFS) are among the most realistic machine
sequencing models there are. These problems deal with the scheduling of a set of jobs …

In practice due dates usually behave more like intervals rather than specific points in time.
This paper studies hybrid flowshops where jobs, if completed inside a due window, are …

This paper studies scheduling of hybrid flowshop with sequence-dependent setup times to
minimize total weighted earliness and tardiness. Due dates are usually intervals in real life …

We observe self-imposed time windows (SITW) whenever a logistics service provider quotes
a delivery time window to his customer. Once this time window is communicated, the …

In this paper we address a hybrid flow shop scheduling problem considering the
minimization of the sum of the total earliness and tardiness penalties. This problem is proven …

In classical scheduling problems, it is often assumed that the machines are available during
the whole planning horizon, while in realistic environments, machines need to be …

No-wait flow-shop scheduling problems refer to the set of problems in which a number of
jobs are available for processing on a number of machines in a flow-shop context with the …

Several efficient pull production control policies for serial lines implementing the lean/JIT
manufacturing philosophy can be found in the production management literature. A recent …

Purpose–The purpose of this paper is to solve a flexible job shop scheduling problem where
alternate machines are available to process the same job. The study considers the Flexible …