A genetic algorithm based approach for scheduling of jobs containing multiple orders in a three-machine flowshop

International Journal of Production Research

Volumn 48, Issue 15, 2010, Pages 4379-4396

  Liu, Cheng Hsiang ^a  

^a NATIONAL PINGTUNG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Genetic algorithm; Multiple orders per job; Scheduling; Total weighted tardiness; Wafer fabrication

Indexed keywords

JOB SCHEDULING; MULTIPLE ORDERS; TOTAL-WEIGHTED TARDINESS; WAFER FABRICATION; WAFER FABRICATIONS;

SILICON WAFERS;

GENETIC ALGORITHMS;

EID: 77953636273     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540902933163     Document Type: Article

References (16)

1. Asano, M. and Ohta, H., 2002. A heuristic for job shop scheduling to minimize total weighted tardiness. Computers and Industrial Engineering, 42 (2-4), 137-147.
2. Cheung, W. and Zhou, H., 2001. Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Annals of Operations Research, 107 (1-4), 65-81. (Pubitemid 33634450)
3. DeJong, K., (1975). An analysis of the behavior of a class of genetic adaptive systems. Dissertation (PhD). University of Michigan, Ann Arbor.
4. Deo, S., Javadpour, R., and Knapp, G.M., 2002. Multiple setup PCB assembly planning using genetic algorithms. Computers and Industrial Engineering, 42 (1), 1-16.
5. Erramilli, V. and Mason, S.J., 2006. Multiple orders per job compatible batch scheduling. IEEE Transactions on Electronics Packaging Manufacturing, 29 (4), 285-296.
6. Holland, J., 1975. Adaptation in natural and artificial systems. Ann Arbor, MI: The University of Michigan Press.
7. Jia, J. and Mason, S.J., 2009. Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines. International Journal of Production Research, 47 (10), 2565-2585.
8. Kim, J., 1999. A hybrid genetic approach for single machine scheduling with distinct due dates and release times. In: Proceedings of Korea-Russia international symposium on science and technology, 22-25 June Novosibirsk, Russia, 245-248.
9. Kim, D.-W., Na, D.-G., and Chen, F.F., 2003. Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robotics and Computer-Integrated Manufacturing, 19 (1-2), 173-181.
10. Laub, J.D., Fowler, J.W., and Keha, A.B., 2007. Minimizing makespan with multiple-orders-per-job in a two-machine flowshop. European Journal of Operational Research, 182 (1), 63-79.
11. Mason, S.J., et al., (2004). The single machine multiple orders per job scheduling problem. ASU working paper ASUIE-ORPS-2004-3004, Arizona State University, Phoenix, AZ.
12. Ponnambala, S.G., Ramkumar, V., and Jawahar, N., 2001. A multiobjective genetic algorithm for job shop scheduling. Production Planning and Control, 12 (8), 764-774.
13. Qu, P., (2004). The multiple orders per job scheduling problems. Dissertation (PhD). University of Arkansas, Fayetteville, AR.
14. Qu, P. and Mason, S.J., 2005. Metaheuristic scheduling of 300-mm lots containing multiple orders. IEEE Transactions on Semiconductor Manufacturing, 18 (4), 633-643.
15. Tanrisever, F., Kutanoglu, E. and Mason, S.J., 2004. Forming and scheduling jobs from multiple orders with different attributes: a computational study of special cases. In: Proceedings of 13th IIE industrial engineering research conference, 15-19 May, Houston, TX.
16. Tasgetiren, M.F., Pan, Q.-K., and Liang, Y.-C., 2009. A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers and Operations Research, 36 (6), 1900-1915.