Title :
Scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times using variable neighborhood search
Author :
Driessel, R. ; Moench, Lars
Author_Institution :
Dept. of Math. & Comput. Sci., Univ. of Hagen, Hagen, Germany
Abstract :
In this paper, we discuss a scheduling problem for jobs on identical parallel machines. Ready times of the jobs, precedence constraints, and sequence-dependent setup times are considered. We are interested in minimizing the performance measure total weighted tardiness. Scheduling problems of this type are quite important in semiconductor manufacturing. We suggest a variable neighborhood search (VNS) scheme for this problem. Based on computational experiments with stochastically generated test instances we are able to show that the VNS approach clearly outperforms heuristics based on the apparent tardiness cost with setups and ready times (ATCSR) dispatching rule in many situations.
Keywords :
integrated circuit manufacture; minimisation; search problems; semiconductor device manufacture; stochastic processes; parallel machine job scheduling; semiconductor manufacturing; sequence-dependent setup time; stochastic test generation; total weighted tardiness minimization; variable neighborhood search scheme; Computer science; Job shop scheduling; Manufacturing systems; Mathematics; Parallel machines; Processor scheduling; Semiconductor device manufacture; Testing; Time factors; Weight measurement; Parallel Machines; Scheduling; Total Weighted Tardiness; Variable Neighborhood Search;
Conference_Titel :
Computers & Industrial Engineering, 2009. CIE 2009. International Conference on
Conference_Location :
Troyes
Print_ISBN :
978-1-4244-4135-8
Electronic_ISBN :
978-1-4244-4136-5
DOI :
10.1109/ICCIE.2009.5223515
