메뉴 건너뛰기




Volumn 22, Issue 4, 2000, Pages 501-524

Batch scheduling in process industries: An application of resource-constrained project scheduling

Author keywords

Batch scheduling; Process industries; Resource constrained project scheduling

Indexed keywords


EID: 0001775820     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002910000042     Document Type: Article
Times cited : (77)

References (64)
  • 3
    • 84918379220 scopus 로고
    • A formal set of algorithms for project scheduling with critical path scheduling / material requirements planning
    • Aquilano NJ, Smith DE (1980) A formal set of algorithms for project scheduling with critical path scheduling / material requirements planning. Journal of Operations Management 1: 57-67
    • (1980) Journal of Operations Management , vol.1 , pp. 57-67
    • Aquilano, N.J.1    Smith, D.E.2
  • 4
    • 0031351620 scopus 로고    scopus 로고
    • Issues in the use, design and evolution of process scheduling and planning systems
    • Applequist G, Samikoglu O, Pekny J, Reklaitis GV (1997) Issues in the use, design and evolution of process scheduling and planning systems. ISA Transactions 36: 81-121
    • (1997) ISA Transactions , vol.36 , pp. 81-121
    • Applequist, G.1    Samikoglu, O.2    Pekny, J.3    Reklaitis, G.V.4
  • 5
    • 0026904034 scopus 로고
    • Production planning knowledge-based systems for pharmaceutical manufacturing lines
    • Artiba A, Tahon C (1992) Production planning knowledge-based systems for pharmaceutical manufacturing lines. European Journal of Operational Research 61: 18-29
    • (1992) European Journal of Operational Research , vol.61 , pp. 18-29
    • Artiba, A.1    Tahon, C.2
  • 10
    • 0032093568 scopus 로고    scopus 로고
    • Scheduling of a multi-product batch process in the chemical industry
    • Blömer F, Günther HO (1998) Scheduling of a multi-product batch process in the chemical industry. Computers in Industry 36: 245-259
    • (1998) Computers in Industry , vol.36 , pp. 245-259
    • Blömer, F.1    Günther, H.O.2
  • 14
    • 85037467460 scopus 로고    scopus 로고
    • Solving a chemical batch scheduling problem by local search
    • University of Osnabrück
    • Brucker P, Hurink J (1999) Solving a chemical batch scheduling problem by local search. Osnabrücker Schriften zur Mathematik, Heft 215, University of Osnabrück
    • (1999) Osnabrücker Schriften Zur Mathematik , Issue.215
    • Brucker, P.1    Hurink, J.2
  • 16
    • 0010436732 scopus 로고    scopus 로고
    • Rounding strategies for mixed integer programs arising from chemical production planning
    • Burkhard RE, Kocher M, Rudolf R (1998b) Rounding strategies for mixed integer programs arising from chemical production planning. Yugoslav Journal of Operations Research 8: 9-23
    • (1998) Yugoslav Journal of Operations Research , vol.8 , pp. 9-23
    • Burkhard, R.E.1    Kocher, M.2    Rudolf, R.3
  • 17
    • 0027693102 scopus 로고
    • Simultaneous optimization of chemical flowshop sequencing and topology using genetic algorithms
    • Cartwright HM, Long A (1993) Simultaneous optimization of chemical flowshop sequencing and topology using genetic algorithms. Industrial & Engineering Chemistry Research 32: 2706-2713
    • (1993) Industrial & Engineering Chemistry Research , vol.32 , pp. 2706-2713
    • Cartwright, H.M.1    Long, A.2
  • 18
    • 0025571942 scopus 로고
    • Scheduling of serial multiproduct batch processes via simulated annealing
    • Das H, Cummings PT, LeVan MD (1990) Scheduling of serial multiproduct batch processes via simulated annealing. Computers & Chemical Engineering 14: 1351-1362
    • (1990) Computers & Chemical Engineering , vol.14 , pp. 1351-1362
    • Das, H.1    Cummings, P.T.2    Levan, M.D.3
  • 19
    • 0029231167 scopus 로고
    • Optimal short-term scheduling of maintenance and production for multipurpose plants
    • Dedopoulos IT, Shah N (1995) Optimal short-term scheduling of maintenance and production for multipurpose plants. Industrial & Engineering Chemistry Research 34: 192-201
    • (1995) Industrial & Engineering Chemistry Research , vol.34 , pp. 192-201
    • Dedopoulos, I.T.1    Shah, N.2
  • 20
    • 0030574803 scopus 로고    scopus 로고
    • Modelling setup times, process batches and transfer batches using activity network logic
    • Demeulemeester, EL, Herroelen, WS (1996) Modelling setup times, process batches and transfer batches using activity network logic. European Journal of Operational Research 89: 355-365
    • (1996) European Journal of Operational Research , vol.89 , pp. 355-365
    • Demeulemeester, E.L.1    Herroelen, W.S.2
  • 21
    • 0032210246 scopus 로고    scopus 로고
    • A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence constraints
    • De Reyck B, Herroelen W (1998) A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence constraints. European Journal of Operational Research 111: 152-174
    • (1998) European Journal of Operational Research , vol.111 , pp. 152-174
    • De Reyck, B.1    Herroelen, W.2
  • 22
    • 0033311742 scopus 로고    scopus 로고
    • The multi-mode resource-constrained project scheduling problem with generalized precedence relations
    • De Reyck B, Herroelen W (1999) The multi-mode resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research 119: 538-556
    • (1999) European Journal of Operational Research , vol.119 , pp. 538-556
    • De Reyck, B.1    Herroelen, W.2
  • 24
    • 0000685021 scopus 로고    scopus 로고
    • RTN-based rolling horizon algorithms for medium term scheduling of multipurpose plants
    • Dimitriadis AD, Shah N, Pantelides CC (1997) RTN-based rolling horizon algorithms for medium term scheduling of multipurpose plants. Computers & Chemical Engineering S21: S1061-S1066
    • (1997) Computers & Chemical Engineering , vol.S21
    • Dimitriadis, A.D.1    Shah, N.2    Pantelides, C.C.3
  • 29
    • 26344480934 scopus 로고
    • Netzplanorientierte Auftragsterminierung bei offener Fertigung
    • Günther HO (1992) Netzplanorientierte Auftragsterminierung bei offener Fertigung. OR Spektrum 14: 229-240
    • (1992) OR Spektrum , vol.14 , pp. 229-240
    • Günther, H.O.1
  • 30
    • 0030081179 scopus 로고    scopus 로고
    • A scheduling problem in glass manufacturing
    • He DW, Kusiak A, Artiba A (1996) A scheduling problem in glass manufacturing. UE Transactions 28: 129-139
    • (1996) UE Transactions , vol.28 , pp. 129-139
    • He, D.W.1    Kusiak, A.2    Artiba, A.3
  • 34
    • 0030291270 scopus 로고    scopus 로고
    • Optimal scheduling of multiproduct batch processes for various intermediate storage policies
    • Kim M, Jung JH, Lee IB (1996) Optimal scheduling of multiproduct batch processes for various intermediate storage policies. Industrial & Engineering Chemistry Research 35: 4058-4066
    • (1996) Industrial & Engineering Chemistry Research , vol.35 , pp. 4058-4066
    • Kim, M.1    Jung, J.H.2    Lee, I.B.3
  • 35
    • 0012364441 scopus 로고
    • Project scheduling under resource constraints: Efficient heuristics for several problem classes
    • Heidelberg
    • Kolisch R (1995) Project scheduling under resource constraints: efficient heuristics for several problem classes. Physica, Heidelberg
    • (1995) Physica
    • Kolisch, R.1
  • 36
    • 0027545176 scopus 로고
    • A general algorithm for short-term scheduling of batch operations - I. MILP Formulation
    • Kondili E, Pantelides CC, Sargent RWH (1993) A general algorithm for short-term scheduling of batch operations - I. MILP Formulation. Computers & Chemical Engineering 17: 211-227
    • (1993) Computers & Chemical Engineering , vol.17 , pp. 211-227
    • Kondili, E.1    Pantelides, C.C.2    Sargent, R.W.H.3
  • 37
    • 0024984801 scopus 로고
    • Completion time algorithms for serial multiproduct batch processes with shared storage
    • Ku HM, Karimi I (1990) Completion time algorithms for serial multiproduct batch processes with shared storage. Computers & Chemical Engineering 14: 49-69
    • (1990) Computers & Chemical Engineering , vol.14 , pp. 49-69
    • Ku, H.M.1    Karimi, I.2
  • 38
    • 0028501041 scopus 로고
    • Heuristic algorithm for scheduling batch and semi-continuous plants with production deadlines, intermediate storage limitations and equipment changeover costs
    • Kudva G, Elkamel A, Pekny JF, Reklaitis GV (1994) Heuristic algorithm for scheduling batch and semi-continuous plants with production deadlines, intermediate storage limitations and equipment changeover costs. Computers & Chemical Engineering 18: 859-875
    • (1994) Computers & Chemical Engineering , vol.18 , pp. 859-875
    • Kudva, G.1    Elkamel, A.2    Pekny, J.F.3    Reklaitis, G.V.4
  • 40
    • 0031190611 scopus 로고    scopus 로고
    • Mathematical programming formulation for scheduling of batch operations based on nonuniform time discretization
    • Mockus L, Reklaitis GV (1997) Mathematical programming formulation for scheduling of batch operations based on nonuniform time discretization. Computers & Chemical Engineering 21: 1147-1156
    • (1997) Computers & Chemical Engineering , vol.21 , pp. 1147-1156
    • Mockus, L.1    Reklaitis, G.V.2
  • 42
    • 0030257561 scopus 로고    scopus 로고
    • New MILP models for scheduling of multiproduct batch plants under zero-wait policy
    • Moon S, Park S, Lee WK (1996) New MILP models for scheduling of multiproduct batch plants under zero-wait policy. Industrial & Engineering Chemistry Research 35: 3458-3469
    • (1996) Industrial & Engineering Chemistry Research , vol.35 , pp. 3458-3469
    • Moon, S.1    Park, S.2    Lee, W.K.3
  • 43
    • 85037453357 scopus 로고    scopus 로고
    • Project scheduling with limited cumulative resources: Modelling and basic concepts and results
    • Glasgow
    • Neumann K (1999) Project scheduling with limited cumulative resources: modelling and basic concepts and results. Proceedings of IEPM'99, Glasgow
    • (1999) Proceedings of IEPM'99
    • Neumann, K.1
  • 45
    • 0000497721 scopus 로고    scopus 로고
    • Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
    • Neumann K, Schwindt C (1997) Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production. OR Spektrum 19: 205-217
    • (1997) OR Spektrum , vol.19 , pp. 205-217
    • Neumann, K.1    Schwindt, C.2
  • 46
    • 0001681374 scopus 로고    scopus 로고
    • Methods for the resource-constrained project scheduling problem with regular and nonregular objective functions and schedule-dependent time windows
    • Wȩglarz J (ed) Kluwer, Boston
    • Neumann K, Zimmermann J (1999) Methods for the resource-constrained project scheduling problem with regular and nonregular objective functions and schedule-dependent time windows. In: Wȩglarz J (ed) Project scheduling: recent models, algorithms, and applications, pp 261-287. Kluwer, Boston
    • (1999) Project Scheduling: Recent Models, Algorithms, and Applications , pp. 261-287
    • Neumann, K.1    Zimmermann, J.2
  • 47
    • 0027628281 scopus 로고
    • An exact algorithm for resource constrained sequencing with application to production scheduling under an aggregate deadline
    • Pekny JF, Miller DL, Kudva GK (1993) An exact algorithm for resource constrained sequencing with application to production scheduling under an aggregate deadline. Computers & Chemical Engineering 17: 671-682
    • (1993) Computers & Chemical Engineering , vol.17 , pp. 671-682
    • Pekny, J.F.1    Miller, D.L.2    Kudva, G.K.3
  • 48
    • 0002584921 scopus 로고    scopus 로고
    • An alternate MILP model for short term scheduling of batch plants with preordering constraints
    • Pinto M, Grossmann IE (1996) An alternate MILP model for short term scheduling of batch plants with preordering constraints. Industrial & Engineering Chemistry Research 35: 338-342
    • (1996) Industrial & Engineering Chemistry Research , vol.35 , pp. 338-342
    • Pinto, M.1    Grossmann, I.E.2
  • 49
    • 0032386621 scopus 로고    scopus 로고
    • Assignment and sequencing models for the scheduling of process systems
    • Pinto M, Grossmann IE (1998) Assignment and sequencing models for the scheduling of process systems. Annals of Operations Research 81: 443-466
    • (1998) Annals of Operations Research , vol.81 , pp. 443-466
    • Pinto, M.1    Grossmann, I.E.2
  • 50
    • 0003049975 scopus 로고    scopus 로고
    • Overview of scheduling and planning of batch process operations
    • Reklaitis GV, Sunol AK, Rippin, DWT, Hortaçsu Ö (eds) Springer, Berlin Heidelberg New York
    • Reklaitis GV (1996) Overview of scheduling and planning of batch process operations. In: Reklaitis GV, Sunol AK, Rippin, DWT, Hortaçsu Ö (eds) Batch processing systems engineering, pp 660-705. Springer, Berlin Heidelberg New York
    • (1996) Batch Processing Systems Engineering , pp. 660-705
    • Reklaitis, G.V.1
  • 51
    • 0027676062 scopus 로고
    • Batch process systems engineering: A retrospective and prospective review
    • Rippin DWT (1993) Batch process systems engineering: A retrospective and prospective review. Computers & Chemical Engineering 17: S1-S13
    • (1993) Computers & Chemical Engineering , vol.17
    • Rippin, D.W.T.1
  • 53
    • 0029717404 scopus 로고    scopus 로고
    • A simple continuous-time process scheduling formulation and a novel solution algorithm
    • Schilling G, Pantelides CC (1996) A simple continuous-time process scheduling formulation and a novel solution algorithm. Computers & Chemical Engineering 20: S1221-S1226
    • (1996) Computers & Chemical Engineering , vol.20
    • Schilling, G.1    Pantelides, C.C.2
  • 54
    • 0026851729 scopus 로고
    • Besondere Anforderungen an die Produktions-planung und -steuerung in der chemischen und pharmazeutischen Industrie
    • Schürbüscher D, Metzner W, Lempp P (1992) Besondere Anforderungen an die Produktions-planung und -steuerung in der chemischen und pharmazeutischen Industrie. Chemie-Ingenieur-Technik 64: 334-341
    • (1992) Chemie-Ingenieur-Technik , vol.64 , pp. 334-341
    • Schürbüscher, D.1    Metzner, W.2    Lempp, P.3
  • 56
    • 85037451061 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for the project duration problem subject to temporal and cumulative resource constraints
    • Glasgow
    • Schwindt C (1999) A branch-and-bound algorithm for the project duration problem subject to temporal and cumulative resource constraints. Proceedings of IEPM'99, Glasgow
    • (1999) Proceedings of IEPM'99
    • Schwindt, C.1
  • 57
    • 0027545175 scopus 로고
    • A general algorithm for short-term scheduling of batch operations - II. Computational issues
    • Shah N, Pantelides CC, Sargent RWH (1993a) A general algorithm for short-term scheduling of batch operations - II. Computational issues. Computers & Chemical Engineering 17: 229-244
    • (1993) Computers & Chemical Engineering , vol.17 , pp. 229-244
    • Shah, N.1    Pantelides, C.C.2    Sargent, R.W.H.3
  • 60
    • 0032096811 scopus 로고    scopus 로고
    • Multi-mode resource-constrained project scheduling by a simple, general, and powerful sequencing algorithm
    • Sprecher A, Drexl A (1998) Multi-mode resource-constrained project scheduling by a simple, general, and powerful sequencing algorithm. European Journal of Operational Research 107: 431-450
    • (1998) European Journal of Operational Research , vol.107 , pp. 431-450
    • Sprecher, A.1    Drexl, A.2
  • 61
    • 0029636114 scopus 로고
    • Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
    • Sprecher A, Kolisch R, Drexl A (1995) Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research 80: 94-102
    • (1995) European Journal of Operational Research , vol.80 , pp. 94-102
    • Sprecher, A.1    Kolisch, R.2    Drexl, A.3
  • 64
    • 0010440703 scopus 로고    scopus 로고
    • An interval-based mathematical model for the scheduling of resource-constrained batch chemical processes
    • Reklaitis GV, Sunol AK, Rippin, DWT, Hortaçsu Ö (eds) Springer, Berlin Heidelberg New York
    • Zentner MG, Reklaitis GV (1996) An interval-based mathematical model for the scheduling of resource-constrained batch chemical processes. In: Reklaitis GV, Sunol AK, Rippin, DWT, Hortaçsu Ö (eds) Batch processing systems engineering, pp 779-807. Springer, Berlin Heidelberg New York
    • (1996) Batch Processing Systems Engineering , pp. 779-807
    • Zentner, M.G.1    Reklaitis, G.V.2


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