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.
A hybrid tabu search heuristic for the twostage assembly scheduling problem
 International Journal of Operations Research
, 2006
"... AbstractIn this paper, we address the twostage assembly scheduling problem where there are m machines at the first stage and an assembly machine at the second stage. The objective is to schedule the jobs on the machines so that total completion time of all n jobs is minimized. Optimal solutions are ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
AbstractIn this paper, we address the twostage assembly scheduling problem where there are m machines at the first stage and an assembly machine at the second stage. The objective is to schedule the jobs on the machines so that total completion time of all n jobs is minimized. Optimal solutions are obtained for two special cases. A simulated annealing heuristic, a tabu search heuristic, and a hybrid tabu search heuristic are proposed for the general case. The proposed heuristics are compared with the existing heuristics and shown to be more efficient. The computational analysis shows that the proposed hybrid tabu search heuristic improves the error rate by about 60 and 90 percent over tabu search and simulated annealing heuristics, respectively, where the CPU time of all the three heuristics is almost the same.
A TIMEDEPENDENT SCHEDULING PROBLEM TO MINIMIZE THE SUM OF THE TOTAL WEIGHTED TARDINESS AMONG TWO AGENTS
, 2016
"... A timedependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ..."
Abstract
 Add to MetaCart
(Show Context)
A timedependent scheduling problem to minimize the sum of the total weighted tardiness among two agents