Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes

International Journal of Production Research

Volumn 44, Issue 12, 2006, Pages 2337-2360

  Kashan, A H ^a   Karimi, B ^a   Jolai, F ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Batch processing machine; Genetic algorithm; Makespan; Scheduling; Simulated annealing

Indexed keywords

EID: 85016094525     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540500525254     Document Type: Article

References (30)

1. Ahmadi, J.H., Ahmadi, R.H., Dasu, S. and Tang, C.S., Batching and scheduling jobs on batch and discrete processors. Oper. Res., 1992, 40, 750-763.
2. Balasubramanian, H., Monch, L., Fowler, J. and Pfund, M., Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness. Int. J. Prod. Res., 2004, 42, 1621-1638.
3. Bean, J.C., Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput., 1994, 6, 154-160.
4. Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Potts, C., Tautenhahn, T. and Van de Velde, S., Scheduling a batching machine. J. Schedul., 1998, 1, 31-54.
5. Chandru, V., Lee, C.Y. and Uzsoy, R., Minimizing total completion time on batch-processing machines. Int. J. Prod. Res., 1993a, 31, 2097-2121.
6. Chandru, V., Lee, C.Y. and Uzsoy, R., Minimizing total completion time on a batchprocessing machine with job families. Oper. Res. Lett., 1993b, 13, 61-65.
7. Coffman, E.G., Garey, M. and Johnson, D.S., Approximation algorithm for bin-packing problem an updated survey. In Algorithm Design for Computer System Design, edited by Y. Ausiello, M. Licertini, and P. Serafini, pp. 49-106, 1984 (Springer: New York, NY).
8. Dobson, G. and Nambimadom, R.S., The Batch Loading and Scheduling Problem. Research Report, 1992 (Simon School of Business Administration, University of Rochester, Rochester, NY).
9. Dupont, L. and Dhaenens-Flipo, C., Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Comput. Oper. Res., 2002, 29, 807-819.
10. Dupont, L. and Jolai Ghazvini, F., An efficient heuristic for minimizing mean flow time on a single-batch-processing machine, in Proceeding of the 2nd International French-Quebec Conference on Industrial Engineering, Albi, France, 1997a, paper no. 36.
11. Dupont, L. and Jolai Ghazvini, F., Branch-and-bound method for minimizing mean flow time on a single-batch-processing machine. Int. J. Ind. Eng., 1997b, 4, 197-203.
12. Dupont, L. and Jolai Ghazvini, F., Minimizing makespan on a single-batch-processing machine with non-identical job sizes. Eur. J. Automat. Sys., 1998, 32, 431-440.
13. Gen, M. and Cheng, R., Genetic Algorithms and Engineering Design, 1997, pp. 1-41 (Wiley: New York, NY).
14. Hochbaum, D.S. and Landy, D., Scheduling semiconductor burn-in operations to minimize total flow time. Oper. Res., 1997, 45, 874-885.
15. Ikura, Y. and Gimple, M., Efficient scheduling algorithms for a single-batch-processing machine. Oper. Res. Lett., 1986, 5, 61-65.
16. Jolai, F., Minimizing number of tardy jobs on a batch-processing machine with incompatible job families. Eur. J. Oper. Res., 2005, 162, 184-190.
17. Jolai Ghazvini, F. and Dupont, L., Minimizing mean flow time on a single-batch-processing machine with non-identical job sizes. Int. J. Prod. Econ., 1998, 55, 273-280.
18. Kempf, K.G., Uzsoy, R. and Wang, C.S., Scheduling a single-batch-processing machine with secondary resource constraints. J. Manuf. Sys., 1998, 17, 37-51.
19. Koh, S.G., Koo, P.H., Kim, D.C. and Hur, W.S., Scheduling a single-batch-processing machine with arbitrary job sizes and incompatible job families. Int. J. Prod. Econ., 2005, 98, 81-96.
20. Lee, C.Y. and Uzsoy, R., Minimizing makespan on a single-batch-processing machine with dynamic job arrivals. Int. J. Prod. Res., 1999, 37, 219-236.
21. Lee, C.Y., Uzsoy, R. and Martin-Vega, L.A., Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res., 1992, 40, 764-775.
22. Li, C.L. and Lee, C.Y., Scheduling with agreeable release times and due dates on a batch-processing machine. Eur. J. Oper. Res., 1997, 96, 564-569.
23. Mehta, S.V. and Uzsoy, R., Minimizing total tardiness on a batch-processing machine with incompatible job families. IIE Trans. Schedul. Logist., 1998, 30, 165-178.
24. Melouk, S., Damodaran, P. and Chang, P.Y., Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. Int. J. Prod. Econ., 2004, 87, 141-147.
25. Monch, L., Balasubramanian, H., Fowler, J. and Pfund, M., Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput. Oper. Res., 2005, 32, 2731-2750.
26. Shuguang, L., Guojun, L., Xiaoli, W. and Qiming, L., Minimizing makespan on a single batching machine with release times and non-identical job sizes. Oper. Res. Lett., 2005, 33, 157-164.
27. Uzsoy, R., A single-batch-processing machine with non-identical job sizes. Int. J. Prod. Res., 1994, 32, 1615-1635.
28. Uzsoy, R., Scheduling batch-processing machines with incompatible job families. Int. J. Prod. Res, 1995, 33, 2685-2708.
29. Uzsoy, R. and Yang, Y., Minimizing total weighted completion time on a singlebatch-processing machine. Prod. Oper. Manag., 1997, 6, 57-73.
30. Wang, C. and Uzsoy, R., A genetic algorithm to minimize maximum lateness on a batch-processing machine. Comput. Oper. Res., 2002, 29, 1621-1640.