메뉴 건너뛰기




Volumn 39, Issue 7, 2012, Pages 1315-1324

Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning

Author keywords

Reinforcement learning; Scheduling; Tardiness; Unrelated parallel machines

Indexed keywords

ARRIVAL TIME; COMPUTATIONAL EXPERIMENT; DECISION TIME; DOMAIN KNOWLEDGE; DUE DATES; DYNAMIC ENVIRONMENTS; FUNCTION APPROXIMATION; NEAR-OPTIMAL POLICIES; POISSON PROCESS; PRIORITY RULES; REINFORCEMENT LEARNING METHOD; REWARD FUNCTION; SCHEDULING PROBLEM; STATE FEATURE; TARDINESS; TEST PROBLEM; UNRELATED PARALLEL MACHINES; WEIGHTED TARDINESS;

EID: 81555208210     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.07.019     Document Type: Article
Times cited : (75)

References (43)
  • 1
    • 0031211263 scopus 로고    scopus 로고
    • Scheduling parallel machines to minimize total weighted and unweighted tardiness
    • B. Alidaee, and D. Rosa Scheduling parallel machines to minimize total weighted and unweighted tardiness Computers & Operations Research 24 8 1997 775 788
    • (1997) Computers & Operations Research , vol.24 , Issue.8 , pp. 775-788
    • Alidaee, B.1    Rosa, D.2
  • 2
    • 0034292154 scopus 로고    scopus 로고
    • Tabu search for scheduling on identical parallel machines to minimize mean tardiness
    • DOI 10.1023/A:1008918229511
    • V.A. Armentano, and D.S. Yamashita Tabu search for scheduling on identical parallel machines to minimize mean tardiness Journal of Intelligent Manufacturing 11 5 2000 453 460 (Pubitemid 32067227)
    • (2000) Journal of Intelligent Manufacturing , vol.11 , Issue.5 , pp. 453-460
    • Armentano, V.A.1    Yamashita, D.S.2
  • 3
    • 0034325416 scopus 로고    scopus 로고
    • Dynamic job-shop scheduling using reinforcement learning agents
    • M.E. Aydin, and E. Öztemel Dynamic job-shop scheduling using reinforcement learning agents Robotics and Autonomous Systems 33 2 2000 169 178
    • (2000) Robotics and Autonomous Systems , vol.33 , Issue.2 , pp. 169-178
    • Aydin, M.E.1    Öztemel, E.2
  • 4
    • 0002009274 scopus 로고
    • A dynamic priority rule for scheduling against due-dates
    • K.R. Baker, and J.W.M. Bertrand A dynamic priority rule for scheduling against due-dates Journal of Operations Management 3 1 1983 37 42
    • (1983) Journal of Operations Management , vol.3 , Issue.1 , pp. 37-42
    • Baker, K.R.1    Bertrand, J.W.M.2
  • 5
    • 0035145661 scopus 로고    scopus 로고
    • Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
    • DOI 10.1016/S0895-7177(00)00250-8, PII S0895717700002508
    • J. Bank, and F. Werner Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties Mathematical and Computer Modelling 33 4-5 2001 363 383 (Pubitemid 32122694)
    • (2001) Mathematical and Computer Modelling , vol.33 , Issue.4-5 , pp. 363-383
    • Bank, J.1    Werner, F.2
  • 8
    • 0029371267 scopus 로고
    • Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms
    • R. Cheng, M. Gen, and T. Tozawa Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms Computers & Industrial Engineering 29 14 1995 513 517
    • (1995) Computers & Industrial Engineering , vol.29 , Issue.14 , pp. 513-517
    • Cheng, R.1    Gen, M.2    Tozawa, T.3
  • 10
    • 33747155109 scopus 로고    scopus 로고
    • Reinforcement learning in a distributed market-based production control system
    • DOI 10.1016/j.aei.2006.01.001, PII S1474034606000024
    • B.C. Csáji, L. Monostori, and B. Kádár Reinforcement learning in a distributed market-based production control system Advanced Engineering Informatics 20 3 2006 279 288 (Pubitemid 44233382)
    • (2006) Advanced Engineering Informatics , vol.20 , Issue.3 , pp. 279-288
    • Csaji, B.C.1    Monostori, L.2    Kadar, B.3
  • 11
    • 7044232937 scopus 로고    scopus 로고
    • Improving Multi-agent Based Scheduling by Neurodynamic Programming
    • Holonic and Multi-Agent Systems for Manufacturing
    • B.C. Csáji, B. Kádár, and L. Monostori Improving multiagent based scheduling by neurodynamic programming HoloMAS, LNAI 2744 2003 110 123 (Pubitemid 37095389)
    • (2003) Lecture Notes in Computer Science , Issue.2744 , pp. 110-123
    • Csaji, B.C.1    Kadar, B.2    Monostori, L.3
  • 12
    • 0032643313 scopus 로고    scopus 로고
    • Solving semi-Markov decision problems using average reward reinforcement learning
    • T.K. Das, A. Gosavi, S. Mahadevan, and N. Marchalleck Solving semi-Markov decision problems using average reward reinforcement learning Management Science 45 4 1999 560 574
    • (1999) Management Science , vol.45 , Issue.4 , pp. 560-574
    • Das, T.K.1    Gosavi, A.2    Mahadevan, S.3    Marchalleck, N.4
  • 13
    • 0033887569 scopus 로고    scopus 로고
    • Error bound for common due date assignment and job scheduling on parallel machines
    • DOI 10.1023/A:1007644826949
    • J.E. Diamond, and T.C.E. Cheng Error bound for common due date assignment and job scheduling on parallel machines IIE Transactions 32 5 2000 445 448 (Pubitemid 30540762)
    • (2000) IIE Transactions (Institute of Industrial Engineers) , vol.32 , Issue.5 , pp. 445-448
    • Diamond, J.E.1    Cheng, T.C.E.2
  • 16
    • 2342446663 scopus 로고    scopus 로고
    • Reinforcement learning algorithm based on policy iteration for average reward: Empirical results with yield management and convergence analysis
    • A.A. Gosavi Reinforcement learning algorithm based on policy iteration for average reward: empirical results with yield management and convergence analysis Machine Learning 55 1 2004 5 29
    • (2004) Machine Learning , vol.55 , Issue.1 , pp. 5-29
    • Gosavi, A.A.1
  • 17
    • 0742319170 scopus 로고    scopus 로고
    • Reinforcement learning for long-run average cost
    • A. Gosavi Reinforcement learning for long-run average cost European Journal of Operational Research 155 3 2004 654 674
    • (2004) European Journal of Operational Research , vol.155 , Issue.3 , pp. 654-674
    • Gosavi, A.1
  • 18
    • 1142293166 scopus 로고    scopus 로고
    • Distributed reinforcement learning control for batch sequencing and sizing in just-in-time manufacturing systems
    • J. Hong, and V.V. Prabhu Distributed reinforcement learning control for batch sequencing and sizing in just-in-time manufacturing systems Applied Intelligence 20 2004 71 87
    • (2004) Applied Intelligence , vol.20 , pp. 71-87
    • Hong, J.1    Prabhu, V.V.2
  • 19
    • 3042836706 scopus 로고    scopus 로고
    • A weighted modified due date rule for sequencing to minimize weighted tardiness
    • J.J. Kanet, and X. Li A weighted modified due date rule for sequencing to minimize weighted tardiness Journal of Scheduling 7 4 2004 261 276
    • (2004) Journal of Scheduling , vol.7 , Issue.4 , pp. 261-276
    • Kanet, J.J.1    Li, X.2
  • 20
    • 0037328729 scopus 로고    scopus 로고
    • Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective
    • D.W. Kim, D.G. Na, and F.F. Chen Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective Robotics and Computer-Integrated Manufacturing 19 1-2 2003 173 181
    • (2003) Robotics and Computer-Integrated Manufacturing , vol.19 , Issue.12 , pp. 173-181
    • Kim, D.W.1    Na, D.G.2    Chen, F.F.3
  • 22
    • 0036644332 scopus 로고    scopus 로고
    • Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness
    • DOI 10.1023/A:1015487829051
    • M.Y. Kovalyov, and F. Werner Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness Journal of Heuristics 8 4 2002 415 428 (Pubitemid 34691604)
    • (2002) Journal of Heuristics , vol.8 , Issue.4 , pp. 415-428
    • Kovalyov, M.Y.1    Werner, F.2
  • 23
    • 0042311378 scopus 로고    scopus 로고
    • Scheduling unrelated parallel machines to minimize total weighted tardiness
    • DOI 10.1016/S0305-0548(02)00105-3, PII S0305054802001053
    • C.F. Liaw, Y.K. Lin, C.Y. Cheng, and M. Chen Scheduling unrelated parallel machines to minimize total weighted tardiness Computers and Operations Research 30 12 2003 1777 1789 (Pubitemid 36893352)
    • (2003) Computers and Operations Research , vol.30 , Issue.12 , pp. 1777-1789
    • Liaw, C.-F.1    Lin, Y.-K.2    Cheng, C.-Y.3    Chen, M.4
  • 24
    • 0029752592 scopus 로고    scopus 로고
    • Average reward reinforcement learning method: Foundations, algorithms, and empirical results
    • S. Mahadevan Average reward reinforcement learning method: foundations, algorithms, and empirical results Machine Learning 22 1 1996 159 196
    • (1996) Machine Learning , vol.22 , Issue.1 , pp. 159-196
    • Mahadevan, S.1
  • 25
    • 0000672424 scopus 로고
    • Fast learning in networks of locally-tuned processing units
    • J. Moddy, and C.J. Darken Fast learning in networks of locally-tuned processing units Neural Computation 1 1989 281 294
    • (1989) Neural Computation , vol.1 , pp. 281-294
    • Moddy, J.1    Darken, C.J.2
  • 27
    • 0041776646 scopus 로고
    • Myopic heuristics for the single machine weighted tardiness problem
    • Graduate School of Industrial Administration, Garnegie-Mellon University
    • Rachamadugu RV, Morton TE. Myopic heuristics for the single machine weighted tardiness problem. Working paper #28-81-82, Graduate School of Industrial Administration, Garnegie-Mellon University; 1981.
    • (1981) Working Paper #28-81-82
    • Rachamadugu, R.V.1    Morton, T.E.2
  • 28
    • 0023437076 scopus 로고
    • A comparative analysis of the COVERT job sequencing rule using various shop performance measures
    • R.S. Russell, E.M. Dar-El, and B.M. Taylor A comparative analysis of the COVERT job sequencing rule using various shop performance measures International Journal of Production Research 25 10 1987 1523 1540
    • (1987) International Journal of Production Research , vol.25 , Issue.10 , pp. 1523-1540
    • Russell, R.S.1    Dar-El, E.M.2    Taylor, B.M.3
  • 29
    • 85152626183 scopus 로고
    • A reinforcement learning method for maximizing undiscounted rewards
    • Morgan Kaufmann, San Mateo, CA
    • Schwartz A. A reinforcement learning method for maximizing undiscounted rewards. In: Proceedings of the 10th international conference on machine learning, Morgan Kaufmann, San Mateo, CA; 1993. p. 298305.
    • (1993) Proceedings of the 10th International Conference on Machine Learning , pp. 298305
    • Schwartz, A.1
  • 30
    • 33751077547 scopus 로고    scopus 로고
    • A policy gradient method for semi-Markov decision processes with application to call admission control
    • DOI 10.1016/j.ejor.2006.02.023, PII S0377221706001317
    • S.S. Singh, V.B. Tadić, and A. Doucet A policy gradient method for semi-Markov decision processes with application to call admission control European Journal of Operational Research 178 3 2007 808 818 (Pubitemid 44765147)
    • (2007) European Journal of Operational Research , vol.178 , Issue.3 , pp. 808-818
    • Singh, S.S.1    Tadic, V.B.2    Doucet, A.3
  • 31
    • 0033166361 scopus 로고    scopus 로고
    • Parallel machine scheduling with earliness and tardiness penalties
    • DOI 10.1016/S0305-0548(98)00090-2, PII S0305054898000902
    • F. Sivrikaya-Serifoglu, and G. Ulusoy Parallel machine scheduling with earliness and tardiness penalties Computers and Operations Research 26 8 1999 773 787 (Pubitemid 29351336)
    • (1999) Computers and Operations Research , vol.26 , Issue.8 , pp. 773-787
    • Sivrikaya-Srifoglu, F.1    Ulusoy, G.2
  • 32
    • 0037395532 scopus 로고    scopus 로고
    • Parallel machine earliness and tardiness scheduling with proportional weights
    • DOI 10.1016/S0305-0548(02)00055-2, PII S0305054802000552
    • H. Sun, and G. Wang Parallel machine earliness and tardiness scheduling with proportional weights Computers and Operations Research 30 5 2003 801 808 (Pubitemid 36175285)
    • (2003) Computers and Operations Research , vol.30 , Issue.5 , pp. 801-808
    • Sun, H.1    Wang, G.2
  • 34
    • 0032050241 scopus 로고    scopus 로고
    • Model-based average reward reinforcement learning
    • PII S0004370298000022
    • P. Tadepalli, and D. Ok Model-based average reward reinforcement learning Artificial Intelligence 100 12 1998 177 224 (Pubitemid 128403240)
    • (1998) Artificial Intelligence , vol.100 , Issue.1-2 , pp. 177-224
    • Tadepalli, P.1    Ok, D.2
  • 36
    • 0023399009 scopus 로고
    • Priority rules for job shops with weighted tardiness costs
    • A. Vepsalainen, and T.E. Morton Priority rules for job shops with weighted tardiness costs Management Science 33 8 1987 1035 1047 (Pubitemid 17656065)
    • (1987) Management Science , vol.33 , Issue.8 , pp. 1035-1047
    • Vepsalainen Ari, P.J.1    Morton Thomas, E.2
  • 37
    • 0032770980 scopus 로고    scopus 로고
    • Improved heuristics for the n-job single-machine weighted tardiness problem
    • DOI 10.1016/S0305-0548(98)00048-3, PII S0305054898000483
    • A. Volgenant, and E. Teerhuis Improved heuristics for the n-job single-machine weighted tardiness problem Computers & Operations Research 26 1 1999 35 44 (Pubitemid 29350684)
    • (1999) Computers and Operations Research , vol.26 , Issue.1 , pp. 35-44
    • Volgenant, A.1    Teerhuis, E.2
  • 38
    • 10844274625 scopus 로고    scopus 로고
    • Application of reinforcement learning for agent-based production scheduling
    • Y.C. Wang, and J.M. Usher Application of reinforcement learning for agent-based production scheduling Engineering Applications of Artificial Intelligence 18 1 2005 73 82
    • (2005) Engineering Applications of Artificial Intelligence , vol.18 , Issue.1 , pp. 73-82
    • Wang, Y.C.1    Usher, J.M.2
  • 39
    • 0035906316 scopus 로고    scopus 로고
    • Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective
    • DOI 10.1016/S0925-5273(00)00066-9, PII S0925527300000669
    • M.X. Weng, J. Lu, and H. Ren Unrelated parallel machine scheduling with setup time consideration and a total weighted completion time objective International Journal of Production Economics 70 3 2001 215 226 (Pubitemid 32272150)
    • (2001) International Journal of Production Economics , vol.70 , Issue.3 , pp. 215-226
    • Weng, M.X.1    Lu, J.2    Ren, H.3
  • 40
    • 0036568108 scopus 로고    scopus 로고
    • Approximation algorithms for common due date assignment and job scheduling on parallel machines
    • W.Q. Xiao, and C.L. Li Approximation algorithms for common due date assignment and job scheduling on parallel machines IIE Transactions 34 5 2002 467 477
    • (2002) IIE Transactions , vol.34 , Issue.5 , pp. 467-477
    • Xiao, W.Q.1    Li, C.L.2
  • 41
    • 0037321475 scopus 로고    scopus 로고
    • An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times
    • F. Yalaoui, and C. Chu An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times IIE Transactions 35 2 2003 183 190
    • (2003) IIE Transactions , vol.35 , Issue.2 , pp. 183-190
    • Yalaoui, F.1    Chu, C.2
  • 42
    • 0041732082 scopus 로고    scopus 로고
    • Soft computing for scheduling with batch setup times and earliness-tardiness penalties on parallel machines
    • Y. Yi, and D.W. Wang Soft computing for scheduling with batch setup times and earliness-tardiness penalties on parallel machines Journal of Intelligent Manufacturing 14 3-4 2003 311 322
    • (2003) Journal of Intelligent Manufacturing , vol.14 , Issue.34 , pp. 311-322
    • Yi, Y.1    Wang, D.W.2


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