Results 1 
5 of
5
A Survey of Scheduling Problems with Setup Times or Costs
"... The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setu ..."
Abstract

Cited by 104 (5 self)
 Add to MetaCart
The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. The objective of this paper is to provide an extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers. Given that so many papers have appeared in a short time, there are cases where different researchers addressed the same problem independently, and sometimes by using even the same technique, e.g., genetic algorithm. Throughout the paper we identify such areas where independently developed techniques need to be compared. The paper classifies scheduling problems into those with batching and nonbatching considerations, and with sequenceindependent and sequencedependent setup times. It further categorizes the literature according to shop environments, including singlemachine, parallel machines, flow shop, nowait flow shop, flexible flow shop, job shop, open shop, and others.
Lower Bounds for Tardiness Minimization on a Single Machine with Family Setup Times
, 2006
"... AbstractIn this paper, we consider the scheduling of N jobs on a single machine with family setup times in order to minimize the total tardiness. The set of jobs is divided into F families. Between two jobs of the same family, we do not have to stop the machine. However, when switching from one fami ..."
Abstract
 Add to MetaCart
(Show Context)
AbstractIn this paper, we consider the scheduling of N jobs on a single machine with family setup times in order to minimize the total tardiness. The set of jobs is divided into F families. Between two jobs of the same family, we do not have to stop the machine. However, when switching from one family to another, a setup is required. Each family is characterized by a setup time independent of the sequence. We propose a set of approaches to compute lower bounds for the tardiness criterion. These approaches are analyzed and tested on a large set of numerical experiments in order to identify the dominant lower bounds.
1 Minimizing Mean Flow Time for the TwoMachine Scheduling Problem with a Single Server
, 2013
"... In this paper, we consider the problem of scheduling a set of jobs on two parallel machines to minimize the sum of completion times. Each job requires a setup which must be done by a single server. It is known that this problem is strongly NPhard. We propose two mixed integer linear programming mod ..."
Abstract
 Add to MetaCart
In this paper, we consider the problem of scheduling a set of jobs on two parallel machines to minimize the sum of completion times. Each job requires a setup which must be done by a single server. It is known that this problem is strongly NPhard. We propose two mixed integer linear programming models and a simulated annealing algorithm. The performance of these algorithms is evaluated for instances with up to 250 jobs.
unknown title
"... Heuristic methods for the identical parallel machine owtime problem with setup times ..."
Abstract
 Add to MetaCart
(Show Context)
Heuristic methods for the identical parallel machine owtime problem with setup times
Heuristics for Scheduling Wafer Lots at the Deposition Workstation in a Semiconductor Wafer Fab
"... This study focuses on the problem of scheduling wafer lots of several product families in the deposition workstation in a semiconductor wafer fabrication facility. There are multiple identical parallel machines in the deposition workstation, and two types of setups, recorddependent setup and family ..."
Abstract
 Add to MetaCart
This study focuses on the problem of scheduling wafer lots of several product families in the deposition workstation in a semiconductor wafer fabrication facility. There are multiple identical parallel machines in the deposition workstation, and two types of setups, recorddependent setup and family setup, may be required at the deposition machines. A recorddependent setup is needed to find optimal operational conditions for a wafer lot on a machine, and a family setup is needed between processings of different families. We suggest twophase heuristic algorithms in which a priorityrulebased scheduling algorithm is used to generate an initial schedule in the first phase and the schedule is improved in the second phase. Results of computational tests on randomly generated test problems show that the suggested algorithms outperform a scheduling method used in a real manufacturing system in terms of the sum of weighted flowtimes of the wafer lots.