An adaptive genetic algorithm to the single machine scheduling problem with earliness and tardiness penalties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6404 LNAI, Issue , 2010, Pages 203-212

  Ribeiro, Fábio Fernandes ^a   Souza, Marcone Jamilson Freitas ^b   De Souza, Sérgio Ricardo ^a  

^a CENTRO FEDERAL DE EDUCAÇÃO TECNOLÓGICA DE MINAS GERAIS   (Brazil)

^b FEDERAL UNIVERSITY OF OURO PRETO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE GENETIC ALGORITHMS; COMPUTATIONAL TESTS; DUE-WINDOW; EARLINESS AND TARDINESS PENALTIES; EVALUATION PROCESS; INITIAL POPULATION; JOB SEQUENCES; POLYNOMIAL-TIME ALGORITHMS; SEARCH OPERATORS; SEQUENCE-DEPENDENT SETUP TIME; SINGLE MACHINE SCHEDULING PROBLEMS; SOLUTION SPACE;

ADAPTIVE ALGORITHMS; ARTIFICIAL INTELLIGENCE; GENETIC ALGORITHMS; GROUP TECHNOLOGY; MACHINERY; POLYNOMIAL APPROXIMATION;

MATHEMATICAL OPERATORS;

EID: 78649979026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16138-4_21     Document Type: Conference Paper

References (12)

1. Allahverdi, A., Ng, C., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187, 985-1032 (2008) (Pubitemid 350236619)
2. Wan, G., Yen, B.P.C.: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties. European Journal of Operational Research 142, 271-281 (2002) (Pubitemid 34803133)
3. Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is np-hard. Mathematics of Operations Research 15, 483-495 (1990)
4. Lee, C.Y., Choi, J.Y.: A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Computers and Operations Research 22, 857-869 (1995)
5. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109-133 (1995)
6. Gomes Jr., A.C., Carvalho, C.R.V., Munhoz, P.L.A., Souza, M.J.F.: Um método heurístico híbrido para a resolução do problema de sequenciamento em uma máquina com penalidades por antecipação e atraso da produção. In: Anais do XXXIX Simpósio Brasileiro de Pesquisa Operacional - XXXIX SBPO, Fortaleza, Brazil, pp. 1649-1660 (2007)
7. Prais, M., Ribeiro, C.C.: An application to a matrix decomposition problem in tdma traffic assignmen. INFORMS - Journal on Computing 12, 164-176 (2000)
8. Liaw, C.F.: A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers and Operations Research 26, 679-693 (1999)
9. Mazzini, R., Armentano, V.A.: A heuristic for single machine scheduling with early and tardy costs. European Journal of Operational Research 128, 129-146 (2001) (Pubitemid 32022966)
10. Rabadi, G., Mollaghasemi, M., Anagnostopoulos, G.C.: A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time. Computers and Operations Research 31, 1727-1751 (2004)
11. Rosa, B.F., Souza, M.J.F., Souza, S.R.: Formulações de programação matemática para o problema de sequenciamento em uma máquina com janelas de entrega distintas e tempo de preparação dependentes da sequência de produção. In: Anais do XXXII Congresso Nacional de Matemática Aplicada e Computacional - CNMAC 2009, Cuiabá (2009)
12. Penna, P.H.V.: Um algoritmo heurístico híbrido para minimizar os custos com a antecipação e o atraso da produção em ambientes com janelas de entrega e tempos de preparação dependentes da sequência de produção. In: Dissertação de mestrado, Programa de Pós- Graduação em Engenharia Mineral, Escola de Minas, UFOP, Ouro Preto (2009)