메뉴 건너뛰기




Volumn 165, Issue 2, 2005, Pages 314-328

Maximization of solution flexibility for robust shop scheduling

Author keywords

Deadlines; Dynamic programming; Flexibility; Release dates; Shop scheduling

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; ONLINE SYSTEMS; PROBLEM SOLVING; REAL TIME SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING;

EID: 13444291281     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.04.004     Document Type: Conference Paper
Times cited : (54)

References (11)
  • 1
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job-shop scheduling
    • Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job-shop scheduling. Management Science. 34:1988;391-401
    • (1988) Management Science , vol.34 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 2
    • 0032653344 scopus 로고    scopus 로고
    • Characterization of a set of schedules in a resource-constrained multi-project scheduling problem with multiple modes
    • Artigues C., Roubellat F., Billaut J.C. Characterization of a set of schedules in a resource-constrained multi-project scheduling problem with multiple modes. International Journal of Industrial Engineering. 6(2):1999;112-122
    • (1999) International Journal of Industrial Engineering , vol.6 , Issue.2 , pp. 112-122
    • Artigues, C.1    Roubellat, F.2    Billaut, J.C.3
  • 3
    • 85013191950 scopus 로고    scopus 로고
    • Characterization of a set of schedules in a multiple resource context
    • Billaut J.C., Roubellat F. Characterization of a set of schedules in a multiple resource context. Journal of Decision Systems. 5(1-2):1996;95-109
    • (1996) Journal of Decision Systems , vol.5 , Issue.1-2 , pp. 95-109
    • Billaut, J.C.1    Roubellat, F.2
  • 4
    • 43949161199 scopus 로고
    • A branch and bound algorithm for the job-shop problem
    • Brucker P., Jurisch B., Sievers B. A branch and bound algorithm for the job-shop problem. Discrete Applied Mathematics. 49(1-3):1994;107-127
    • (1994) Discrete Applied Mathematics , vol.49 , Issue.1-3 , pp. 107-127
    • Brucker, P.1    Jurisch, B.2    Sievers, B.3
  • 5
    • 0001947856 scopus 로고
    • Probabilistic learning combinations of local job-shop scheduling rules
    • J.F. Muth, & G.L. Thompson. Englewood Cliffs, NJ: Prentice Hall
    • Fisher H., Thompson G.L. Probabilistic learning combinations of local job-shop scheduling rules. Muth J.F., Thompson G.L. Industrial Scheduling. 1963;225-251 Prentice Hall, Englewood Cliffs, NJ
    • (1963) Industrial Scheduling , pp. 225-251
    • Fisher, H.1    Thompson, G.L.2
  • 6
    • 13444269168 scopus 로고    scopus 로고
    • Project scheduling under uncertainty - Survey and research potentials
    • Herroelen W., Leus R. Project scheduling under uncertainty - survey and research potentials. European Journal of Operational Research. 165:2005;289-306
    • (2005) European Journal of Operational Research , vol.165 , pp. 289-306
    • Herroelen, W.1    Leus, R.2
  • 7
    • 0002241669 scopus 로고
    • Scheduling with batching: Minimizing the number of tardy jobs
    • Hochbaum D.S., Landy D.I. Scheduling with batching: minimizing the number of tardy jobs. Operations Research Letters. 16:1994;79-86
    • (1994) Operations Research Letters , vol.16 , pp. 79-86
    • Hochbaum, D.S.1    Landy, D.I.2
  • 9
    • 2442737544 scopus 로고
    • An approach for real time scheduling for activities with time and resource constraints
    • R. Slowinski, & J. Weglarz. Amsterdam: Elsevier
    • Erschler J., Roubellat F. An approach for real time scheduling for activities with time and resource constraints. Slowinski R., Weglarz J. Advances in Project Scheduling. 1989;Elsevier, Amsterdam
    • (1989) Advances in Project Scheduling
    • Erschler, J.1    Roubellat, F.2
  • 11
    • 0000927907 scopus 로고    scopus 로고
    • A graph-theoretic decomposition of the job-shop scheduling problem to achieve scheduling robustness
    • Wu S.D., Byeon E.S., Storer R.H. A graph-theoretic decomposition of the job-shop scheduling problem to achieve scheduling robustness. Operations Research. 47(1):1999;113-124
    • (1999) Operations Research , vol.47 , Issue.1 , pp. 113-124
    • Wu, S.D.1    Byeon, E.S.2    Storer, R.H.3


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