The majority of scheduling research assumes setup as negligible or part of the processing
time. While this assumption simplifies the analysis and/or reflects certain applications, it …

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 …

The distributed permutation flowshop scheduling problem (DPFSP) has attracted much
attention in recent years. In this paper, we extend the DPFSP by considering the sequence …

Iterated Greedy (IG) algorithms are based on a very simple principle, are easy to implement
and can show excellent performance. In this paper, we propose two new IG algorithms for a …

This paper reviews the literature related to the class of scheduling problems that involve
sequence-dependent setup times (costs), an important consideration in many practical …

Much of the research on operations scheduling problems has either ignored setup times or
assumed that setup times on each machine are independent of the job sequence. This …

This paper examines scheduling in flexible flow lines with sequence-dependent setup times
to minimize makespan. This type of manufacturing environment is found in industries such …

This paper deals with the permutation flowshop scheduling problem in which there are
sequence dependent setup times on each machine, commonly known as the SDST …

Flowshop scheduling problems with setup times arise naturally in many practical situations.
This paper provides a review of static and deterministic flowshop scheduling research …

This paper proposes a hybrid metaheuristic for the minimization of makespan in scheduling
problems with parallel machines and sequence-dependent setup times. The solution …