Title of article
A Genetic Algorithm for Solving a New Mathematical Model of Single Machine Scheduling with Three Criteria
Author/Authors
Mohammad Akhshabi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
7
From page
5564
To page
5570
Abstract
Appropriate programming in a gorge of plant or the key and strategic machine has much effect to increasing efficiency. Due to increasing global market competitiveness the regarded targets have become complex. Thus one criterion is not enough and scheduling with multiple criteria is more realistic. The main difficulty of these scheduling problems is extensive solving time needed to it. In this paper a new mathematical model with three criteria that contains customer satisfying and production costs is offered to single machine scheduling and solved with lingo8 software. Due to being NP-hard, Genetic Algorithm is developed which need less time than lingo8. Comparing of them show that lingo can not solve the instances with more than 10 jobs while Genetic Algorithm solve the instances with more than 100 jobs. The results show the most efficiency of Genetic Algorithms than lingo software
Keywords
Multi Criteria , Earliness Penalty , Tardiness Penalty , Completion time , single machine , Genetic algorithms , Scheduling
Journal title
Australian Journal of Basic and Applied Sciences
Serial Year
2010
Journal title
Australian Journal of Basic and Applied Sciences
Record number
676101
Link To Document