Combination of genetic algorithm and LP-metric to solve single machine bi-criteria scheduling problem

IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management

Volumn , Issue , 2009, Pages 1915-1919

  Aryanezhad, M B ^a   Jabbarzadeh, A ^a   Zareei, A ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Genetic algorithm; LP metric

Indexed keywords

BI-CRITERIA; DECISION MAKERS; MULTI OBJECTIVE; NP-HARD; PROBLEM COMPLEXITY; SCHEDULING PROBLEM; SEARCH DIRECTION; SERVICE QUALITY; SINGLE MACHINES; TEST PROBLEM; TOTAL-WEIGHTED TARDINESS; WEIGHTED NUMBER;

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; INDUSTRIAL ENGINEERING;

PROBLEM SOLVING;

EID: 77949516636     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IEEM.2009.5373207     Document Type: Conference Paper

References (26)

1. M.B. Aryanezhad, A.S. Kheirkhah, V. Deljoo, and S. M. J Mirzapour Al-e-hashem, "Designing safe job rotation schedules based upon workers' skills," Int. J. Adv. Manuf. Technol., vol. 41, pp. 193-199,2009.
2. M. Pinedo, Scheduling Theory, Algorithms and Systems. NJ : Prentice-Hall, 2002.
3. J. K. Lenstra , A. H. G. Rinnooy Kan, and P. Brucker, "Complexity of machine scheduling problems," Annals of Disc. Math., vol. 1, pp. 343-362, 1977..
4. F. Choobineh , E. Mohebbi, and H. Khoo, "A multiobjective tabu search for a single-machine scheduling problem with sequence-dependent setup times," Eur. J. Oper. Res.,vol.175, pp. 318-337,2006.
5. J.H. Holland, Adaptation in natural and arti3cial systems, 2nd ed. Ann Arbor: University of Michigan Press; 1975.
6. M. Koksalan, and A.B. Keha ,"Using genetic algorithms for single-machine bicriteria scheduling problems," Eur. J. Oper. Res., vol.145, pp.543-55, 2003.
7. M. Sevaux, and S. Dauzere-Peres, "Genetic algorithms to minimize the weighted number of late jobs on a single machine," Eur. J. Oper. Res., vol. 151,pp. 296-306, 2003.
8. C.N. Potts, and L.N.V. Wassenhove, "Algorithms for scheduling a single machine to minimize the weighted number of late jobs," Manag. Sci., vol.34, no. 7 ,pp.834-858, 1988.
9. F.J. Villarreal, and R.L. Bulfin, "Scheduling a single machine to minimize the weighted number of tardy jobs," IIE Trans. vol.15, pp.337-343,1983.
10. a, L. Peridy, and E. Pinson, "branch and bound to minimize the number of late jobs on a single machine with release time constraints," Eur. J. Oper. Res.,vol.144, no.1, pp. 1-11, January 2003.
11. M. Sevaux, and S. Dauzere-Peres, "Genetic algorithms to minimize the weighted number of late jobs on a single machine," Eur. J. Oper. Res.,vol.151, pp.296-306,2003.
12. X. Wang, and L. Tang, "A population-based variable neighborhood search for the single machine total weighted tardiness problem," Comp. Oper. Res., vol.36, pp. 2105-2110, 2009.
13. F. Chou, "An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem," Expert Sys. with Appl., vol. 36 ,pp. 3857-3865,2009.
14. J. K. Lenstra , A. H. G. Rinnooy Kan ,and P. Brucker, " Complexity of machine scheduling problems," Annals of Disc. Math., vol. 1, pp.343-362, 1977.
15. T.E. Morton, R.M. Rachamadugu ,and A. Vepsalainen ," Accurate myopic heuristics for tardiness scheduling," GSIA Working Paper No. 36-83-84. Pitsburgh: Carnegie-Mellon University, 1984.
16. J. J. Kanet, and X. Li, "A weighted modified due date rule for sequencing to minimize weighted tardiness," J. Sched., vol. 7, pp. 261-276, 2004.
17. C. N. Potts, and L. N. V. Wassenhove, "A branch and bound algorithm for the total weighted tardiness problem," Oper. Res., vol. 33, pp. 363-377, 1985.
18. P. A. Huegler, and F. J. Vasko, "A performance comparison of heuristics for the total weighted tardiness problem," Comp. Ind. Eng., vol. 32, no.4, pp. 753-767, 1977.
19. R. K. Congram, C. N. Potts, and S. L. Van de Velde, "An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem," INFORMS J. Comput., vol.14, no.1, pp.52-67,2002.
20. H. A. J. Crauwels, C. N. Potts, and L. N. Van Wassenhove," Local search heuristics for single machine total weighted tardiness scheduling problem," INFORMS J. Comput., vol.10, no.3, pp.341-350,1988.
21. J. B. Wang , Y. Jiang and G. Wang, "Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning," Int. J. Adv. Manuf. Technol.,vol.41, pp.1221-1226, 2009.
22. X. Qi , S. Zhou, and J. Yuan, "Single machine parallelbatch scheduling with deteriorating jobs," Theoreti. Comput. Sci., vol. 410, pp. 830-836, 2009.
23. G. Wana, and B. P. Yen, "Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs," Europ . J. .Oper. Res., vol.195, pp. 89-97, 2009.
24. E. Erel, and J. B. Ghosh, "Batch scheduling to minimize the weighted number of tardy jobs," Comp. & Ind. Eng., vol. 53, pp. 394-400, 2007.
25. P. Chang, S. Chen , and C. Liu , "Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems", Exp. Sys. Appl. , Vo. 33, pp.762-771,2007.
26. U. Haral, R. Chen, W. G. Ferrell Jr, and M. B. Kurz , "Multiobjective single machine scheduling with nontraditional requirements", Inter. J. Prod. Eco., vol.106, pp. 574-584,2007.