Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/inderscience-publishers/minimising-makespan-for-single-burn-in-oven-scheduling-problems-using-vLK9QjPBhD
References (24)
-
M. Besten, T. Stützle, M. Dorigo (2000)
Ant Colony Optimization for the Total Weighted Tardiness Problem -
R. Uzsoy (1994)
Scheduling a single batch processing machine with non-identical job sizesInternational Journal of Production Research, 32
-
R. Uzsoy (1995)
Scheduling batch processing machines with incompatible job familiesInternational Journal of Production Research, 33
-
Chung-Yee Lee, R. Uzsoy, L. Martin-Vega (1992)
Efficient Algorithms for Scheduling Semiconductor Burn-In OperationsOper. Res., 40
-
S. Malve, R. Uzsoy (2007)
A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job familiesComput. Oper. Res., 34
-
Andreas Bauer, B. Bullnheimer, R. Hartl, C. Strauss (1999)
An ant colony optimization approach for the single machine total tardiness problemProceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 2
-
M. Dorigo, G. Caro, L. Gambardella (1999)
Ant Algorithms for Discrete OptimizationArtificial Life, 5
-
Y. Ikura, M. Gimple (1986)
Efficient scheduling algorithms for a single batch processing machineOperations Research Letters, 5
-
Imelda Perez, J. Fowler, W. Carlyle (2005)
Minimizing total weighted tardiness on a single batch process machine with incompatible job familiesComput. Oper. Res., 32
-
Chung-Yee Lee, R. Uzsoy (1999)
Minimizing makespan on a single batch processing machine with dynamic job arrivalsInternational Journal of Production Research, 37
-
G. Sivakumar, P. Shahabudeen (2009)
Design of Multi-stage Adaptive Kanban System using Simulated Annealing algorithmInt. J. Manuf. Res., 4
-
P. Asokan, J. Jerald, S. Arunachalam, T. Page (2008)
Application of Adaptive Genetic Algorithm and Particle Swarm Optimisation in scheduling of jobs and AS/RS in FMSInt. J. Manuf. Res., 3
-
Cheng-Shuo Wang, R. Uzsoy (2002)
A genetic algorithm to minimize maximum lateness on a batch processing machineComput. Oper. Res., 29
-
F. Chou, P. Chang, Hui-Mei Wang (2006)
A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problemThe International Journal of Advanced Manufacturing Technology, 31
-
L. Mönch, H. Balasubramanian, J. Fowler, M. Pfund (2005)
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready timesComput. Oper. Res., 32
-
D. Hochbaum, D. Landy (1997)
Scheduling Semiconductor Burn-In Operations to Minimize Total FlowtimeOper. Res., 45
-
R. Uzsoy, Yaoyu Yang (2009)
MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON A SINGLE BATCH PROCESSING MACHINEProduction and Operations Management, 6
-
F. Ghazvini, L. Dupont (1998)
Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizesInternational Journal of Production Economics, 55
-
Shuguang Li, Guojun Li, Xiaoli Wang, Qiming Liu (2005)
Minimizing makespan on a single batching machine with release times and non-identical job sizesOper. Res. Lett., 33
-
L. Dupont, Clarisse Dhaenens (2002)
Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedureComput. Oper. Res., 29
-
Caroline Gagné, W. Price, M. Gravel (2002)
Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup timesJournal of the Operational Research Society, 53
-
M. Dorigo, L. Gambardella (1997)
Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Trans. Evol. Comput., 1
-
F. Chou (2007)
A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterionThe International Journal of Advanced Manufacturing Technology, 35
-
S. Melouk, P. Damodaran, P. Chang (2004)
Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealingInternational Journal of Production Economics, 87
- Publisher
- Inderscience Publishers
- Copyright
- Copyright © Inderscience Enterprises Ltd. All rights reserved
- ISSN
- 1750-0591
- eISSN
- 1750-0605
- DOI
- 10.1504/IJMR.2010.033467
- Publisher site
- See Article on Publisher Site
Abstract
This paper considers minimising makespan on a single batch processing machine where jobs have dynamic release time and non-identical sizes in burn-in operation of semiconductor final testing. The machine can process one batch at a time as long as its capacity is not exceeded. The processing time of a batch equals to the longest processing time of all jobs in that batch. The problem is proven to be NP-hard and hence a hybrid Ant Colony Optimisation (ACO) method was proposed combined with Dynamic Programming (DP) technique. Computational results show that the joint ACO+DP approach performs considerably well on all instances. (Received 9 April 2009; Revised 27 June 2009; Accepted 13 October 2009)
Journal
International Journal of Manufacturing Research – Inderscience Publishers
Published: Jan 1, 2010