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 …

There is an extensive literature on models that integrate scheduling with batching decisions.
Jobs may be batched if they share the same setup on a machine. Another reason for …

Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

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 …

In many practical situations, batching of similar jobs to avoid set-ups is performed whilst
constructing a schedule. On the other hand, each job may consist of many identical items …

Consider a number of jobs to be processed on a number of identical machines in parallel. A
job has a processing time, a weight and a due date. If a job is followed by another job, a …

This paper surveys the application of simulated annealing (SA) to operations research (OR)
problems. It is concluded that SA has been applied to both traditional (like single machine …

We review three leading stochastic optimization methods—simulated annealing, genetic
algorithms, and tabu search. In each case we analyze the method, give the exact algorithm …

Scheduling is concerned with allocating limited resources to tasks to optimize certain
objective functions. Due to the popularity of the Total Quality Management concept, on-time …

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