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 …

The scheduling of computer and manufacturing systems has been the subject of extensive
research for over forty years. In addition to computers and manufacturing, scheduling theory …

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 …

We propose a general hierarchical procedure to address real-life job shop scheduling
problems. The shop typically produces a variety of products, each with its own arrival stream …

Abstract The Shifting Bottleneck procedure is an intuitive and reasonably good
approximation algorithm for the notoriously difficult classical job shop scheduling problem …

This paper addresses the NP-hard problem of scheduling N independent jobs on a single
machine with release dates, due dates, sequence dependent setup times, and no …

In this paper we discuss a framework for capacity planning and lead time management in
manufacturing companies, with an emphasis on the machine shop. First we show how …

In manufacturing, there is a fundamental conflict between efficient production and delivery
performance. Maximizing machine utilization by batching similar jobs may lead to poor …

The discrete lotsizing and scheduling problem for one machine with sequence-dependent
setup times and setup costs is solved as a single machine scheduling problem, which we …