메뉴 건너뛰기




Volumn 15, Issue 2, 1999, Pages 328-339

An effective approach for job-shop scheduling with uncertain processing requirements

Author keywords

Job shop scheduling; Lagrangian relaxation; Stochastic dynamic programming; Uncertainties

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; PRODUCTION CONTROL; RANDOM PROCESSES; UNCERTAIN SYSTEMS;

EID: 0032654876     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.760354     Document Type: Article
Times cited : (79)

References (23)
  • 1
    • 0026126118 scopus 로고
    • A computational study of the job-shop scheduling problem
    • D. Applegate and W. Cook, "A computational study of the job-shop scheduling problem," ORSA J. Comput., vol. 3, no. 2, pp. 149-156, 1991.
    • (1991) ORSA J. Comput. , vol.3 , Issue.2 , pp. 149-156
    • Applegate, D.1    Cook, W.2
  • 4
    • 0029514770 scopus 로고
    • A effective approach to smartly allocate computing budget for discrete event simulation
    • C. H. Chen, "A effective approach to smartly allocate computing budget for discrete event simulation," in Proc. 34th IEEE Conf. Decision Contr., 1995, pp. 2598-2605.
    • (1995) Proc. 34th IEEE Conf. Decision Contr. , pp. 2598-2605
    • Chen, C.H.1
  • 5
    • 0032186585 scopus 로고    scopus 로고
    • An improvement of the Lagrangean relaxation approach for job shop scheduling: A dynamic programming method
    • Oct.
    • H. Chen, C. Chu, and J. M. Proth, "An improvement of the Lagrangean relaxation approach for job shop scheduling: A dynamic programming method," IEEE Trans. Robot. Automat., vol. 14, pp. 786-795, Oct. 1998.
    • (1998) IEEE Trans. Robot. Automat. , vol.14 , pp. 786-795
    • Chen, H.1    Chu, C.2    Proth, J.M.3
  • 6
    • 0028413489 scopus 로고
    • Scheduling products with bills of materials using an improved Lagrangian relaxation technique
    • Apr.
    • C. Czerwinski and P. B. Luh, "Scheduling products with bills of materials using an improved Lagrangian relaxation technique," IEEE Trans. Robot. Automat., vol. 10, pp. 99-111, Apr. 1994.
    • (1994) IEEE Trans. Robot. Automat. , vol.10 , pp. 99-111
    • Czerwinski, C.1    Luh, P.B.2
  • 7
    • 0028416608 scopus 로고
    • Production planning and scheduling using a fuzzy decision system
    • Apr.
    • L. M. M. Custodio, J. J. S. Sentieiro, and C. F. G. Bispo, "Production planning and scheduling using a fuzzy decision system," IEEE Trans. Robot. Automat., vol. 10, pp. 160-167, Apr. 1994.
    • (1994) IEEE Trans. Robot. Automat. , vol.10 , pp. 160-167
    • Custodio, L.M.M.1    Sentieiro, J.J.S.2    Bispo, C.F.G.3
  • 8
    • 0025898245 scopus 로고
    • On the minimization of the weighted number of tardy job with random processing times and deadline
    • P. De, J. B. Ghosh, and C. E. Wells, "On the minimization of the weighted number of tardy job with random processing times and deadline," Comput. Oper. Res., vol. 18, no. 5, pp. 457-463, 1991.
    • (1991) Comput. Oper. Res. , vol.18 , Issue.5 , pp. 457-463
    • De, P.1    Ghosh, J.B.2    Wells, C.E.3
  • 10
    • 0023825682 scopus 로고
    • Implementation of an expert system for production scheduling
    • R. M. Kerr and R. V. Ebsary, "Implementation of an expert system for production scheduling," Euro. J. Oper. Res., vol. 33, no. 1, pp. 17-29, 1988.
    • (1988) Euro. J. Oper. Res. , vol.33 , Issue.1 , pp. 17-29
    • Kerr, R.M.1    Ebsary, R.V.2
  • 11
    • 0029250558 scopus 로고
    • Stability of queuing networks and scheduling policies
    • Feb.
    • P. R. Kumar and S. P. Meyn, "Stability of queuing networks and scheduling policies," IEEE Trans. Automat. Contr., vol. 40, pp. 251-260, Feb. 1995.
    • (1995) IEEE Trans. Automat. Contr. , vol.40 , pp. 251-260
    • Kumar, P.R.1    Meyn, S.P.2
  • 12
    • 0028494016 scopus 로고
    • Performance bounds for queuing networks and scheduling policies
    • Aug.
    • S. Kumar and P. R. Kumar, "Performance bounds for queuing networks and scheduling policies," IEEE Trans. Automat. Contr., vol. 39, pp. 1600-1611, Aug. 1994.
    • (1994) IEEE Trans. Automat. Contr. , vol.39 , pp. 1600-1611
    • Kumar, S.1    Kumar, P.R.2
  • 13
    • 0028452692 scopus 로고
    • A game-theoretic control approach for job shops in the presence of disruptions
    • V. J. Leon, S. D. Wu, and R. H. Storer, "A game-theoretic control approach for job shops in the presence of disruptions," Int. J. Prod. Res., vol. 32, no. 6, pp. 1451-1476, 1994.
    • (1994) Int. J. Prod. Res. , vol.32 , Issue.6 , pp. 1451-1476
    • Leon, V.J.1    Wu, S.D.2    Storer, R.H.3
  • 15
    • 0027625736 scopus 로고
    • Scheduling of manufacturing systems using the Lagrangian relaxation technique
    • Jan.
    • P. B. Luh and D. J. Hoitomt, "Scheduling of manufacturing systems using the Lagrangian relaxation technique," IEEE Trans. Automat. Contr., vol. 38, pp. 1066-1079, Jan. 1993.
    • (1993) IEEE Trans. Automat. Contr. , vol.38 , pp. 1066-1079
    • Luh, P.B.1    Hoitomt, D.J.2
  • 16
    • 33748185078 scopus 로고    scopus 로고
    • Scheduling of design projects with uncertain number of iterations
    • P. B. Luh, F. Liu, and B. Moser, "Scheduling of design projects with uncertain number of iterations," in Eur. J. Oper. Res., 1998.
    • (1998) Eur. J. Oper. Res.
    • Luh, P.B.1    Liu, F.2    Moser, B.3
  • 17
    • 0000937493 scopus 로고
    • A new scenario decomposition method for large-scale stochastic optimization
    • J. M. Mulvey and A. Ruszczynsky, "A new scenario decomposition method for large-scale stochastic optimization," Oper. Res., vol. 43, no. 3, pp. 477-493, 1995.
    • (1995) Oper. Res. , vol.43 , Issue.3 , pp. 477-493
    • Mulvey, J.M.1    Ruszczynsky, A.2
  • 19
    • 0000514655 scopus 로고
    • A scenarios and policy aggregation in optimization under uncertainty
    • R. T. Rockafellar and R. J. B. Wets, "A scenarios and policy aggregation in optimization under uncertainty," Math. Oper. Res., vol. 16, no. 1, pp. 119-147, 1991.
    • (1991) Math. Oper. Res. , vol.16 , Issue.1 , pp. 119-147
    • Rockafellar, R.T.1    Wets, R.J.B.2
  • 20
    • 0030193240 scopus 로고    scopus 로고
    • Optimal sequence in stochastic single machine shops
    • H. M. Soroush, "Optimal sequence in stochastic single machine shops," Comput. Oper. Res., vol. 23, no. 7, pp. 705-721, 1996.
    • (1996) Comput. Oper. Res. , vol.23 , Issue.7 , pp. 705-721
    • Soroush, H.M.1
  • 21
    • 0027719799 scopus 로고
    • The facet ascending algorithm for integer programming problems
    • R. N. Tomastik and P. B. Luh, "The facet ascending algorithm for integer programming problems," in Proc. IEEE Conf. Decision Contr., 1993, pp. 2880-2884.
    • (1993) Proc. IEEE Conf. Decision Contr. , pp. 2880-2884
    • Tomastik, R.N.1    Luh, P.B.2
  • 22
    • 0031121735 scopus 로고    scopus 로고
    • An optimization-based algorithm for job shop scheduling
    • J. Wang, P. B. Luh, X. Zhao, and J. Wang, "An optimization-based algorithm for job shop scheduling," Sadhana, vol. 22, pt. 2, pp. 241-255, 1996.
    • (1996) Sadhana , vol.22 , Issue.2 PART , pp. 241-255
    • Wang, J.1    Luh, P.B.2    Zhao, X.3    Wang, J.4
  • 23
    • 0033247536 scopus 로고    scopus 로고
    • The surrogate gradient algorithm for Lagrangian relaxation
    • X. Zhao, P. B. Luh, and J. Wang, "The surrogate gradient algorithm for Lagrangian relaxation," J. Optim. Theory Appl., 1999.
    • (1999) J. Optim. Theory Appl.
    • Zhao, X.1    Luh, P.B.2    Wang, J.3


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