메뉴 건너뛰기




Volumn 123, Issue 1-3, 2002, Pages 227-256

Scheduling and constraint propagation

Author keywords

Branch and bound algorithm; Constraint propagation; Linear programming; Machine scheduling; Project scheduling resource constraints

Indexed keywords


EID: 84867925682     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00342-0     Document Type: Article
Times cited : (51)

References (48)
  • 2
    • 0001849846 scopus 로고
    • Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis
    • R. Slowinski, J. Weglarz, Elsevier Amsterdam
    • R. Alvarez-Valdés, and J.M. Tamarit Heuristic algorithms for resource-constrained project scheduling: a review and an empirical analysis R. Slowinski, J. Weglarz, Advances in Project Scheduling 1989 Elsevier Amsterdam 113 134
    • (1989) Advances in Project Scheduling , pp. 113-134
    • Alvarez-Valdés, R.1    Tamarit, J.M.2
  • 4
    • 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. 3 1991 149 156
    • (1991) ORSA J. Comput. , vol.3 , pp. 149-156
    • Applegate, D.1    Cook, W.2
  • 5
    • 0003131416 scopus 로고    scopus 로고
    • Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem
    • S. Voss, S. Martello, I.H. Osman, C. Roucairol, Kluwer Academic Publishers Dordrecht
    • T. Baar, P. Brucker, and S. Knust Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem S. Voss, S. Martello, I.H. Osman, C. Roucairol, Meta-Heuristics 1999 Kluwer Academic Publishers Dordrecht
    • (1999) Meta-Heuristics
    • Baar, T.1    Brucker, P.2    Knust, S.3
  • 10
    • 18044401402 scopus 로고    scopus 로고
    • Solving open benchmark problems for the job-shop problem
    • P. Brucker, W. Brinkkötter, Solving open benchmark problems for the job-shop problem, J. Scheduling 4 (2001) 53-64.
    • (2001) J. Scheduling , vol.4 , pp. 53-64
    • Brucker, P.1
  • 11
    • 0032736579 scopus 로고    scopus 로고
    • Resource-constrained project scheduling: Notation, classification, model, and methods
    • P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch Resource-constrained project scheduling: notation, classification, model, and methods Euro. J. Oper. Res. 112 1999 3 41
    • (1999) Euro. J. Oper. Res. , vol.112 , pp. 3-41
    • Brucker, P.1    Drexl, A.2    Möhring, R.3    Neumann, K.4    Pesch, E.5
  • 12
    • 21844489618 scopus 로고
    • The job-shop problem and immediate selection
    • P. Brucker, B. Jurisch, and A. Krämer The job-shop problem and immediate selection Ann. Oper. Res. 50 1994 73 114
    • (1994) Ann. Oper. Res. , vol.50 , pp. 73-114
    • Brucker, P.1    Jurisch, B.2    Krämer, A.3
  • 13
    • 43949161199 scopus 로고
    • A branch & bound algorithm for the job-shop problem
    • P. Brucker, B. Jurisch, and B. Sievers A branch & bound algorithm for the job-shop problem Discrete Appl. Math. 49 1994 107 127
    • (1994) Discrete Appl. Math. , vol.49 , pp. 107-127
    • Brucker, P.1    Jurisch, B.2    Sievers, B.3
  • 14
    • 0034563615 scopus 로고    scopus 로고
    • A linear programming and constraint propagation based lower bound for the RCPSP
    • P. Brucker, S. Knust, A linear programming and constraint propagation based lower bound for the RCPSP, Euro. J. Oper. Res. 127 (2000) 355-362.
    • (2000) Euro. J. Oper. Res. , vol.127 , pp. 355-362
    • Brucker, P.1    Knust, S.2
  • 15
    • 0347240810 scopus 로고    scopus 로고
    • A new tabu search procedure for an audit-scheduling problem
    • P. Brucker, and D. Schumacher A new tabu search procedure for an audit-scheduling problem J. Scheduling 2 1999 157 173
    • (1999) J. Scheduling , vol.2 , pp. 157-173
    • Brucker, P.1    Schumacher, D.2
  • 16
    • 0032096810 scopus 로고    scopus 로고
    • A branch and bound algorithm for the resource-constrained project scheduling problem
    • P. Brucker, S. Knust, A. Schoo, and O. Thiele A branch and bound algorithm for the resource-constrained project scheduling problem Euro. J. Oper. Res. 107 1998 272 288
    • (1998) Euro. J. Oper. Res. , vol.107 , pp. 272-288
    • Brucker, P.1    Knust, S.2    Schoo, A.3    Thiele, O.4
  • 17
    • 0001343733 scopus 로고    scopus 로고
    • A branch & bound method for the general-shop problem with sequence dependent setup times
    • P. Brucker, and O. Thiele A branch & bound method for the general-shop problem with sequence dependent setup times Oper. Res. Spektrum 18 1996 145 161
    • (1996) Oper. Res. Spektrum , vol.18 , pp. 145-161
    • Brucker, P.1    Thiele, O.2
  • 18
    • 0000165767 scopus 로고
    • An algorithm for solving the job-shop problem
    • J. Carlier, and E. Pinson An algorithm for solving the job-shop problem Manage. Sci. 35 1989 164 176
    • (1989) Manage. Sci. , vol.35 , pp. 164-176
    • Carlier, J.1    Pinson, E.2
  • 19
    • 0001013257 scopus 로고
    • A practical use of Jackson's preemptive schedule for solving the job shop problem
    • J. Carlier, and E. Pinson A practical use of Jackson's preemptive schedule for solving the job shop problem Ann. Oper. Res. 26 1990 269 287
    • (1990) Ann. Oper. Res. , vol.26 , pp. 269-287
    • Carlier, J.1    Pinson, E.2
  • 20
    • 0028518441 scopus 로고
    • Adjustment of heads and tails for the job-shop problem
    • J. Carlier, and E. Pinson Adjustment of heads and tails for the job-shop problem Euro. J. Oper. Res. 78 1994 146 161
    • (1994) Euro. J. Oper. Res. , vol.78 , pp. 146-161
    • Carlier, J.1    Pinson, E.2
  • 21
  • 22
    • 0023362513 scopus 로고
    • Project scheduling with resource constraints: A branch and bound approach
    • N. Christofides, R. Alvarez-Valdés, and J.M. Tamarit Project scheduling with resource constraints: a branch and bound approach Euro. J. Oper. Res. 29 1987 262 273
    • (1987) Euro. J. Oper. Res. , vol.29 , pp. 262-273
    • Christofides, N.1    Alvarez-Valdés, R.2    Tamarit, J.M.3
  • 23
    • 0016498438 scopus 로고
    • A comparison of heuristic and optimum solutions in resource-constrained project scheduling
    • E.W. Davis, and J.H. Patterson A comparison of heuristic and optimum solutions in resource-constrained project scheduling Manage. Sci. 21 1975 944 955
    • (1975) Manage. Sci. , vol.21 , pp. 944-955
    • Davis, E.W.1    Patterson, J.H.2
  • 24
    • 0002907360 scopus 로고
    • A branch-and-bound procedure for the multiple resource-constrained project scheduling problem
    • E. Demeulemeester, and W. Herroelen A branch-and-bound procedure for the multiple resource-constrained project scheduling problem Manage. Sci. 38 1992 1803 1818
    • (1992) Manage. Sci. , vol.38 , pp. 1803-1818
    • Demeulemeester, E.1    Herroelen, W.2
  • 25
    • 0012649023 scopus 로고    scopus 로고
    • A survey of interval capacity consistency tests for time- and resource-constrained scheduling
    • J. Weglarz, Kluwer Academic Publishers Dordrecht
    • U. Dorndorf, T.P. Huy, and E. Pesch A survey of interval capacity consistency tests for time- and resource-constrained scheduling J. Weglarz, Project Scheduling 1998 Kluwer Academic Publishers Dordrecht
    • (1998) Project Scheduling
    • Dorndorf, U.1    Huy, T.P.2    Pesch, E.3
  • 26
    • 0034296143 scopus 로고    scopus 로고
    • A time-oriented branch-and-bound algorithm for resource constrained project scheduling with generalized precedence constraints
    • U. Dorndorf, E. Pesch, T. Phan-Huy, A time-oriented branch-and-bound algorithm for resource constrained project scheduling with generalized precedence constraints, Management Science 46 (2000) 1365-1384.
    • (2000) Management Science , vol.46 , pp. 1365-1384
    • Dorndorf, U.1    Pesch, E.2    Phan-Huy, T.3
  • 28
    • 0032709489 scopus 로고    scopus 로고
    • Computing lower bounds by destructive improvement - An application to resource-constrained project scheduling
    • R. Klein, and A. Scholl Computing lower bounds by destructive improvement - an application to resource-constrained project scheduling Euro. J. Oper. Res. 112 1999 322 346
    • (1999) Euro. J. Oper. Res. , vol.112 , pp. 322-346
    • Klein, R.1    Scholl, A.2
  • 29
    • 0001896880 scopus 로고    scopus 로고
    • Adaptive search for solving hard project scheduling problems
    • R. Kolisch, and A. Drexl Adaptive search for solving hard project scheduling problems Naval Res. Logist. 43 1996 23 40
    • (1996) Naval Res. Logist. , vol.43 , pp. 23-40
    • Kolisch, R.1    Drexl, A.2
  • 32
    • 0031492360 scopus 로고    scopus 로고
    • Current trends in deterministic scheduling
    • C.-Y. Lee, L. Lei, and M. Pinedo Current trends in deterministic scheduling Ann. Oper. Res. 70 1997 1 41
    • (1997) Ann. Oper. Res. , vol.70 , pp. 1-41
    • Lee, C.-Y.1    Lei, L.2    Pinedo, M.3
  • 33
    • 33845274958 scopus 로고
    • Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
    • V.J. Leon, and B. Ramamoorthy Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling OR Spektrum 17 1995 173 182
    • (1995) OR Spektrum , vol.17 , pp. 173-182
    • Leon, V.J.1    Ramamoorthy, B.2
  • 36
    • 0032070635 scopus 로고    scopus 로고
    • An exact algorithm for the resource-constrained project scheduling based on a new mathematical formulation
    • A. Mingozzi, V. Maniezzo, and S. Ricciardelli An exact algorithm for the resource-constrained project scheduling based on a new mathematical formulation Manage. Sci. 44 1998 714 729
    • (1998) Manage. Sci. , vol.44 , pp. 714-729
    • Mingozzi, A.1    Maniezzo, V.2    Ricciardelli, S.3
  • 38
    • 84958062698 scopus 로고    scopus 로고
    • Resource constrained project scheduling: Computing lower bounds by solving minimum cut problems, in Algorithms - ESA'99
    • ed. Nesetril Springer, Berlin
    • R.H. Möhring, A.S. Schulz, F. Stork, M. Uetz, Resource constrained project scheduling: computing lower bounds by solving minimum cut problems, in Algorithms - ESA'99, ed. Nesetril, J. Lecture Notes in Computer Science 1643, Proc. 7th Annual European Symp. on Algorithms, Springer, Berlin, 1999, pp. 139-150.
    • (1999) J. Lecture Notes in Computer Science 1643, Proc. 7th Annual European Symp. on Algorithms , pp. 139-150
    • Möhring, R.H.1
  • 39
    • 0031192667 scopus 로고    scopus 로고
    • A genetic algorithm for multi-mode resource constrained project scheduling problem
    • S. Mori, and C.C. Tseng A genetic algorithm for multi-mode resource constrained project scheduling problem Euro. J. Oper. Res. 100 1997 134 141
    • (1997) Euro. J. Oper. Res. , vol.100 , pp. 134-141
    • Mori, S.1    Tseng, C.C.2
  • 40
    • 0000480311 scopus 로고
    • An algorithm for a general class of precedence and resource constrained scheduling problems
    • R. Sowiski, J. Weglarz, Elsevier Science Amsterdam
    • J.H. Patterson, R. Sowiski, F.B. Talbot, and J. Weglarz An algorithm for a general class of precedence and resource constrained scheduling problems R. Sowiski, J. Weglarz, Advances in Project Scheduling 1989 Elsevier Science Amsterdam 3 28
    • (1989) Advances in Project Scheduling , pp. 3-28
    • Patterson, J.H.1    Sowiski, R.2    Talbot, F.B.3    Weglarz, J.4
  • 42
    • 84989730007 scopus 로고
    • Local search techniques for the generalized RCPSP
    • S.E. Sampson, and E.N. Weiss Local search techniques for the generalized RCPSP Naval Res. Logist. Quart. 40 1993 665 675
    • (1993) Naval Res. Logist. Quart. , vol.40 , pp. 665-675
    • Sampson, S.E.1    Weiss, E.N.2
  • 44
    • 0033691202 scopus 로고    scopus 로고
    • Scheduling resource-constrained projects competitively at modest memory requirements
    • A. Sprecher, Scheduling resource-constrained projects competitively at modest memory requirements. Management Science, 46 (2000) 710-723.
    • (2000) Management Science , vol.46 , pp. 10-723
    • Sprecher, A.1
  • 45
    • 0018011301 scopus 로고
    • Multiple resource-constrained scheduling using branch and bound
    • J.P. Stinson, E.W. Davis, and B.M. Khumawala Multiple resource-constrained scheduling using branch and bound AIIE Trans. 10 1978 252 259
    • (1978) AIIE Trans. , vol.10 , pp. 252-259
    • Stinson, J.P.1    Davis, E.W.2    Khumawala, B.M.3
  • 46
    • 0017241984 scopus 로고
    • Heuristic scheduling of activities under resource and precedence restrictions
    • A. Thesen Heuristic scheduling of activities under resource and precedence restrictions Manage. Sci. 23 1976 412 422
    • (1976) Manage. Sci. , vol.23 , pp. 412-422
    • Thesen, A.1
  • 47
    • 0032117729 scopus 로고    scopus 로고
    • A tabu search approach for the resource constrained project scheduling problem
    • P.R. Thomas, and S. Salhi A tabu search approach for the resource constrained project scheduling problem J. Heuristics 4 1998 123 139
    • (1998) J. Heuristics , vol.4 , pp. 123-139
    • Thomas, P.R.1    Salhi, S.2
  • 48
    • 0032045960 scopus 로고    scopus 로고
    • Tabu search for resource-constrained scheduling
    • M.G.A. Verhoeven Tabu search for resource-constrained scheduling Euro. J. Oper. Res. 106 1998 266 276
    • (1998) Euro. J. Oper. Res. , vol.106 , pp. 266-276
    • Verhoeven, M.G.A.1


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