메뉴 건너뛰기




Volumn 34, Issue 11, 2007, Pages 3471-3490

Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach

Author keywords

Metaheuristics; Parallel machine scheduling; Sequence dependent setup times; Total tardiness problem

Indexed keywords

HEURISTIC ALGORITHMS; OPERATIONS RESEARCH; OPTIMIZATION; PRODUCTION ENGINEERING; SCHEDULING;

EID: 34047181001     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.02.009     Document Type: Article
Times cited : (72)

References (24)
  • 1
    • 0344236266 scopus 로고    scopus 로고
    • Metaheuristics in combinatorial optimization: overview and conceptual comparison
    • Blum C., and Roli A. Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Computing Surveys 35 3 (2003) 268-308
    • (2003) ACM Computing Surveys , vol.35 , Issue.3 , pp. 268-308
    • Blum, C.1    Roli, A.2
  • 3
    • 0028550668 scopus 로고
    • The total tardiness problem: review and extensions
    • Koulamas C. The total tardiness problem: review and extensions. Operations Research 42 (1994) 1025-1041
    • (1994) Operations Research , vol.42 , pp. 1025-1041
    • Koulamas, C.1
  • 4
    • 0025211593 scopus 로고
    • Sequencing with earliness and tardiness penalties: a review
    • Baker K.R., and Scudder G.D. Sequencing with earliness and tardiness penalties: a review. Operations Research 38 1 (1990) 22-35
    • (1990) Operations Research , vol.38 , Issue.1 , pp. 22-35
    • Baker, K.R.1    Scudder, G.D.2
  • 5
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • Du J., and Leung J.Y.T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
    • (1990) Mathematics of Operations Research , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.T.2
  • 6
    • 77957077792 scopus 로고
    • A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness
    • Lawler E.L. A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1 (1977) 331-342
    • (1977) Annals of Discrete Mathematics , vol.1 , pp. 331-342
    • Lawler, E.L.1
  • 8
    • 0031075568 scopus 로고    scopus 로고
    • Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
    • Koulamas C. Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem. Naval Research Logistics 44 (1997) 109-125
    • (1997) Naval Research Logistics , vol.44 , pp. 109-125
    • Koulamas, C.1
  • 9
    • 0001096735 scopus 로고
    • Genetic algorithms and random keys for sequencing and optimization
    • Bean J.C. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 6 (1994) 154-160
    • (1994) ORSA Journal on Computing , vol.6 , pp. 154-160
    • Bean, J.C.1
  • 10
  • 12
    • 0000482108 scopus 로고    scopus 로고
    • Scheduling jobs on parallel machines with sequence-dependent setup times
    • Lee Y.H., and Pinedo M. Scheduling jobs on parallel machines with sequence-dependent setup times. European Journal of Operational Research 100 (1997) 464-474
    • (1997) European Journal of Operational Research , vol.100 , pp. 464-474
    • Lee, Y.H.1    Pinedo, M.2
  • 13
    • 0030735290 scopus 로고    scopus 로고
    • A heuristic to minimize the total weighted tardiness with sequence-dependent setups
    • Lee Y.H., Bhaskaran K., and Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transaction 29 (1997) 45-52
    • (1997) IIE Transaction , vol.29 , pp. 45-52
    • Lee, Y.H.1    Bhaskaran, K.2    Pinedo, M.3
  • 14
    • 0034196175 scopus 로고    scopus 로고
    • A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times
    • Tan K.C., Narasimhan R., Rubin P.A., and Ragatz G.L. A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times. Omega International Journal of Management Science 28 (2000) 313-326
    • (2000) Omega International Journal of Management Science , vol.28 , pp. 313-326
    • Tan, K.C.1    Narasimhan, R.2    Rubin, P.A.3    Ragatz, G.L.4
  • 15
    • 0033717569 scopus 로고    scopus 로고
    • Scheduling jobs on parallel machines applying neural network and heuristic rules
    • Park Y., Kim S., and Lee Y.H. Scheduling jobs on parallel machines applying neural network and heuristic rules. Computers & Industrial Engineering 38 (2000) 189-202
    • (2000) Computers & Industrial Engineering , vol.38 , pp. 189-202
    • Park, Y.1    Kim, S.2    Lee, Y.H.3
  • 16
    • 0035401193 scopus 로고    scopus 로고
    • A memetic algorithm for the total tardiness single machine scheduling problem
    • França P.M., Mendes A., and Moscato P. A memetic algorithm for the total tardiness single machine scheduling problem. European Journal of Operational Research 132 (2001) 224-242
    • (2001) European Journal of Operational Research , vol.132 , pp. 224-242
    • França, P.M.1    Mendes, A.2    Moscato, P.3
  • 17
    • 22144443848 scopus 로고    scopus 로고
    • Hybrid tabu-simulated annealing based approach to solve multi-constraint product mix decision problem
    • Mishra N., Prakash, Tiwari M.K., Shankar R., and Chan F.T.S. Hybrid tabu-simulated annealing based approach to solve multi-constraint product mix decision problem. Expert Systems with Applications 29 (2005) 446-454
    • (2005) Expert Systems with Applications , vol.29 , pp. 446-454
    • Mishra, N.1    Prakash2    Tiwari, M.K.3    Shankar, R.4    Chan, F.T.S.5
  • 18
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers, London
    • Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, London
    • (1997) Tabu search
    • Glover, F.1    Laguna, M.2
  • 21
    • 0001344680 scopus 로고    scopus 로고
    • An introduction to variable neighborhood search
    • Voss S., Martello S., Osman I.H., and Roucairol C. (Eds), Kluwer Academic Publishers, Boston
    • Hansen P., and Mladenović N. An introduction to variable neighborhood search. In: Voss S., Martello S., Osman I.H., and Roucairol C. (Eds). Meta-heuristics: advances and trends in local search paradigms for optimization (1999), Kluwer Academic Publishers, Boston 433-458
    • (1999) Meta-heuristics: advances and trends in local search paradigms for optimization , pp. 433-458
    • Hansen, P.1    Mladenović, N.2
  • 22
    • 34047113178 scopus 로고    scopus 로고
    • Koylu R. Tabu search. http://benli.bcc.bilkent.edu.tr/∼lors/lors/method.html
  • 23
    • 34047099112 scopus 로고    scopus 로고
    • Glover FW, Kochenberger GA, editors. Handbook of metaheuristics. Norwell: Kluwer Academic Publishers; 2003.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.