Results 1 
3 of
3
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.
Complexity results for parallel machine scheduling problems with a server in computer systems
"... We consider deterministic scheduling environnement of a computer system composed by a single server and m identical parallel machines. Each of n jobs must be loaded by the server and processed without preemption on one of the parallel machines. After a loading or setup, the server is available to pe ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider deterministic scheduling environnement of a computer system composed by a single server and m identical parallel machines. Each of n jobs must be loaded by the server and processed without preemption on one of the parallel machines. After a loading or setup, the server is available to perform another loading activity, that is to say a single server can handle
Pure cycles in flexible robotic cells
, 2007
"... www.elsevier.com/locate/cor In this study, an mmachine flexible robotic manufacturing cell consisting of CNC machines is considered. The flexibility of the machines leads to a new class of robot move cycles called the pure cycles. We first model the problem of determining the best pure cycle in an ..."
Abstract
 Add to MetaCart
(Show Context)
www.elsevier.com/locate/cor In this study, an mmachine flexible robotic manufacturing cell consisting of CNC machines is considered. The flexibility of the machines leads to a new class of robot move cycles called the pure cycles. We first model the problem of determining the best pure cycle in an mmachine cell as a special travelling salesman problem in which the distance matrix consists of decision variables as well as parameters. We focus on two specific cycles among the huge class of pure cycles. We prove that, in most of the regions, either one of these two cycles is optimal. For the remaining regions we derive worst case performances of these cycles. We also prove that the set of pure cycles dominates the flowshoptype robot move cycles considered in the literature. As a design problem, we consider the number of machines in a cell as a decision variable. We determine the optimal number of machines that minimizes the cycle time for given cell parameters such as the processing times, robot travel times and the loading/unloading times of the machines.