A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penalties

International Journal of Advanced Manufacturing Technology

Volumn 65, Issue 5-8, 2013, Pages 981-989

  Banisadr, A H ^a   Zandieh, M ^b   Mahdavi, Iraj ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

Genetic algorithm; Hybridization; Imperialist competitive algorithm; Single machine scheduling

Indexed keywords

GENETIC ALGORITHMS; MACHINERY; OPTIMIZATION; SCHEDULING;

DIFFERENT SIZES; HYBRID ALGORITHMS; HYBRIDIZATION; IMPERIALIST COMPETITIVE ALGORITHMS; ITS EFFICIENCIES; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE-MACHINE SCHEDULING; TARDINESS PENALTIES;

SCHEDULING ALGORITHMS;

EID: 84866524794     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-012-4233-x     Document Type: Article

References (26)

1. Abdul-Razaq TS, Potts CN (1988) Dynamic programming state-space relaxation for single machine scheduling. J Oper Res Soc 39: 141-152
2. Atashpaz E, Hashemzadeh G, Rajabioun F (2008) Colonial competition algorithm: a novel approach for PID controller design in MIMO distillation column process. Int J Intell Comput Cybern 1(3): 337-355
3. Atashpaz E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialist competitive. IEEE Congress on Evolutionary Computation 4661-4667
4. Bagchi U, Sullivan RS, Chang YL (1986) Minimizing mean absolute deviation of completion times about a common due date. Nav Res Logist Q 33: 227-240
5. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
6. Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38: 22-36
7. Du J, Leung JY (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15: 483-495
8. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading
9. Hall NG (1986) Single and multiple-processor models for minimizing completion time variance. Nav Res Logist Q 33: 49-54
10. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, re-issued by MIT Press (1992)
11. Holland JH (1962) Outline for a logical theory of adaptive systems. J Assoc Comput Mach 9(3): 297-314
12. Kanet JJ (1981) Minimizing the average deviation of job completion times about a common due date. Nav Res Logist Q 28: 643-651
13. Korman K (1994) A pressing matter. Video 46-50
14. Landis K (1993) Group technology and cellular manufacturing in the Westvaco Los Angeles VH Department. Project report in IOM 581, School of Business, University of Southern California
15. Ow PS, Morton TE (1988) Filtered beam search in scheduling. Int J Prod Res 26: 35-62
16. Ow PS, Morton TE (1989) The single machine early/tardy problem. Manag Sci 35: 177-191
17. Reeves CR (1997) Genetic algorithms for the operations researcher. INFORMS J Comput 9: 231-250
18. Reeves C (2003) Genetic algorithms. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer, Dordrecht, pp 55-82
19. Schaller J (2004) Single machine scheduling with early and quadratic tardy penalties. Comput Ind Eng 46: 511-532
20. Sidney JB (1977) Optimal single machine scheduling with earliness and tardiness penalties. Oper Res 25: 62-69
21. Valente JMS (2008) An exact approach for the single machine scheduling problem with linear early and quadratic tardy penalties. Asia Pac J Oper Res 25: 169-186
22. Valente JMS (2008) Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time. Comput Ind Eng 55: 663-675
23. Valente JMS (2009) Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs. Asia Pac J Oper Res 26: 319-339
24. Valente JMS (2007) Heuristics for the single machine scheduling problem with early and quadratic tardy penalties. Eur J Ind Eng 1: 431-448
25. Valente JMS, Goncalves JF (2009) A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Comput Oper Res 36: 2707-2715
26. Wagner BJ, Davis DJ, Kher H (2002) The production of several items in a single facility with linearly changing demand rates. Decis Sci 33: 317-346