Single machine preemptive scheduling by hybridized meta-heuristic approach

2011 IEEE 3rd International Conference on Communication Software and Networks, ICCSN 2011

Volumn , Issue , 2011, Pages 750-753

  Javadian, N ^a   Khorshidian, H ^a   Rezaeian, J ^a   Rahmani, K ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING   (Iran)

Author keywords

Genetic algorithm; Hybrid algorithm; Imperialist competitive algorithm; Just in time; Preemption; Single machine scheduling

Indexed keywords

COMPETITIVE ALGORITHMS; HYBRID ALGORITHMS; JUST IN TIME; PREEMPTION; SINGLE-MACHINE SCHEDULING;

COMMUNICATION; GENETIC ALGORITHMS; HEURISTIC METHODS; INDEPENDENT COMPONENT ANALYSIS; JUST IN TIME PRODUCTION;

HEURISTIC ALGORITHMS;

EID: 80053167346     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCSN.2011.6014999     Document Type: Conference Paper

References (7)

1. Atashpaz-Gargari, E., Lucas, C., 2007. Imperialist Competitive Algorithm: An Algorithm for Optimization Inspired by Imperialistic. IEEE Congress on Evolutionary Computation, 25-28 September 2006 Singapore. 4661-4667.
2. Ballestin, F., Tautmann,N., 2008. An iterated-local-search heuristic for the resource-constrained weighted earlines-stardiness project scheduling problem. International Journal of Production Research, 46 (22), 6231-6249.
3. Brucker, P., Heitmann,S., Hurink, J, 2003. How useful are preemptive schedules? Operations Research Letters, 31 (2) 129-136.
4. Hepdogan, S., Moraga, R, DePuy, G.w., Whitehouse, G. E., 2009. A Meta-RaPS for the early/tardy single machine scheduling problem. International Journal of Production Research, 47 (7),1717-1732.
5. Hendel, F., Runge, N., Sourd, F., 2009. The one-machine justin-time scheduling problem with preemption. Discrete Optimization, 6 (1),10-22.
6. Lenstra, J K., Rinnooy Kan, A. H., Brucker, G. P., 1977. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343-362.
7. Mahnam, M., Moslehi, Gh, 2009. A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times. Engineering Optimization, 41 (6),521-536