Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms

International Journal of Production Economics

Volumn 103, Issue 2, 2006, Pages 882-891

  Damodaran, Purushothaman ^a   Kumar Manjeshwar, Praveen ^a   Srihari, Krishnaswami ^a  

^a State University of New York at Binghamton   (United States)

Author keywords

Batch processing machines; Genetic algorithms; Heuristics; Scheduling

Indexed keywords

ANNEALING; BATCH DATA PROCESSING; PROBLEM SOLVING; SCHEDULING;

BATCH-PROCESSING MACHINES; COMMERCIAL SOLVER; HEURISTICS; RANDOM INSTANCES;

GENETIC ALGORITHMS;

EID: 33745817107     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2006.02.010     Document Type: Article

References (24)

1. Dupont L., and Dhaenens-Flipo C. Minimizing the makespan on a batch processing machine with non-identical job sizes: an exact procedure. Computers & Operations Research 29 (2002) 807-819
2. Ghazvini F.J., and Dupont L. Minimizing mean flow times criteria on a single batch processing machine with non-identical job sizes. International Journal of Production Economics 55 (1998) 273-280
3. Hochbaum D.S., and Landy D. Scheduling semiconductor burn-in operations to minimize total flow time. Operations Research 45 (1997) 874-885
4. Ikura Y., and Gimple M. Scheduling algorithms for a single batch processing Machine. Operations Research Letters 5 (1986) 61-65
5. Lee C.Y., Uzsoy R., and Martin-Vega L.A. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research 40 (1992) 764-775
6. Li C.L., and Lee C.Y. Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research 96 (1997) 564-569
7. Li Y., Ip W.H., and Wang D.W. Genetic algorithm approach to earliness and tardiness scheduling and planning problem. International Journal of Production Economics 54 (1998) 55-76
8. Koksalan M., and Keha A.B. Using genetic algorithms for single machine bicriteria scheduling problems. European Journal of Operational Research 145 (2003) 543-556
9. Melouk S., Damodaran P., and Chang P.-Y. Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics 87 (2004) 141-147
10. Nearchou A.C. The effect of various operators on the genetic search for large scheduling problems. International Journal of Production Economics 88 (2004) 191-203
11. Ng C.T.D., Cheng T.C.E., and Kovalyov M.Y. Single machine batch scheduling with jointly compressible setup and processing times. European Journal of Operational Research 153 (2002) 211-219
12. Pan Y. An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. Operations Research Letters 31 (2003) 492-496
13. Potts C.N., and Kovalyov M.Y. Scheduling with batching: a review. European Journal of Operational Research 120 (2000) 228-249
14. Reeves C. Using genetic algorithms with small populations. In: Forrest S., and Kaufmann M. (Eds). Proceedings of Fifth International Conference on Genetic Algorithms (1993), San Mateo, CA, USA 92-99
15. Reeves C. Genetic algorithms for the Operations Researcher. INFORMS Journal on Computing 9 (1997) 231-250
16. Sung C.S., and Choung Y.I. Minimizing makespan on a single burn-in oven in semiconductor manufacturing. European Journal of Operational Research 120 (2000) 559-574
17. Sung C.S., and Kim Y.H. Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Computers & Operations Research 29 (2002) 275-294
18. Sung C.S., and Yoon S.H. Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed. Engineering Optimization 28 (1997) 231-243
19. Sung C.S., Kim Y.H., and Yoon S.H. A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines. European Journal of Operational Research 121 (2000) 179-192
20. Sung C.S., Choung Y.I., Hong J.M., and Kim Y.H. Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals. Computers & Operations Research 29 (2002) 275-294
21. Sevaux M., and Peres S.D. Genetic algorithms to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research 151 (2003) 296-306
22. Uzsoy R. Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research 32 (1994) 1615-1635
23. Uzsoy R., and Yang Y.Y. Minimizing total weighted completion time on a single batch processing machine. Production and Operations Management 6 (1997) 57-73
24. Wang C.S., and Uzsoy R. A genetic algorithm to minimize maximum lateness on a batch processing machine. Computers and Operations Research 29 (2002) 1621-1640