Combination of Genetic Algorithm and LP-metric to Solve Single Machine Bi-criteria Scheduling Problem

被引:9
作者
Aryanezhad, M. B. [1 ]
Jabbarzadeh, A. [1 ]
Zareei, A. [1 ]
机构
[1] Iran Univ Sci & Technol, Dept Ind Engn, Tehran, Iran
来源
2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4 | 2009年
关键词
LP-metric; Genetic Algorithm; WEIGHTED NUMBER; LATE JOBS; MINIMIZE; SEARCH; BRANCH;
D O I
10.1109/IEEM.2009.5373207
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper addresses single machine bi-criteria scheduling problem with the aim of minimizing total weighted tardiness and weighted number of tardy jobs. While weighted number of tardy jobs measures the service quality provided to customers, total weighted tardiness quantify the magnitude of lateness of each job. Therefore, considering both objectives, simultaneously, will provide the highest customers satisfaction. Both objectives are known to be NP-hard, thus, Genetic Algorithm is hired to solve the problem. Since LP-metric method is a rigorous multi-objective technique for making a combined dimensionless objective, it is used to navigate the search direction of Genetic algorithm. In this way, we can reach to some of solutions that are compatible to decision maker's opinion while overcoming the issue of problem complexity. Finally for testing the efficiency of the proposed approach, some test problems are solved.
引用
收藏
页码:1915 / 1919
页数:5
相关论文
共 24 条
[1]  
[Anonymous], 1975, Ann Arbor
[2]   Designing safe job rotation schedules based upon workers' skills [J].
Aryanezhad, M. B. ;
Kheirkhah, A. S. ;
Deljoo, V. ;
Al-e-hashem, S. M. J. Mirzapour .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41 (1-2) :193-199
[3]   A branch and bound to minimize the number of late jobs on a single machine with release time constraints [J].
Baptiste, Philippe ;
Peridy, Laurent ;
Pinson, Eric .
European Journal of Operational Research, 2003, 144 (01) :1-11
[4]   Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems [J].
Chang, Pei-Chann ;
Chen, Shih-Hsin ;
Liu, Chen-Hao .
EXPERT SYSTEMS WITH APPLICATIONS, 2007, 33 (03) :762-771
[5]   A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times [J].
Choobineh, F. Fred ;
Mohebbi, Esmail ;
Khoo, Hansen .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (01) :318-337
[6]   An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem [J].
Chou, Fuh-Der .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (02) :3857-3865
[7]   An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem [J].
Congram, RK ;
Potts, CN ;
van de Velde, SL .
INFORMS JOURNAL ON COMPUTING, 2002, 14 (01) :52-67
[8]  
CRAUWELS HAJ, 1988, INFORMS J COMPUT, V10, P341
[9]   Batch scheduling to minimize the weighted number of tardy jobs [J].
Erel, Erdal ;
Ghosh, Jay B. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (03) :394-400
[10]   Multiobjective single machine scheduling with nontraditional requirements [J].
Haral, Uday ;
Chen, Rew-Win ;
Ferrell, William G., Jr. ;
Kurz, Mary Beth .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2007, 106 (02) :574-584