메뉴 건너뛰기




Volumn 177, Issue 3, 2007, Pages 2100-2118

Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops

Author keywords

Complex job shops; Genetic algorithms; Scheduling; Shifting bottleneck heuristic

Indexed keywords

HEURISTIC METHODS; JOB ANALYSIS; OPERATIONS RESEARCH; PROCESS ENGINEERING; SCHEDULING;

EID: 33750718514     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.12.020     Document Type: Article
Times cited : (91)

References (31)
  • 1
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • Adams J., Balas E., and 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
    • 0242653680 scopus 로고    scopus 로고
    • Use of genetic algorithms to solve production and operations management problems: A review
    • Aytug H., Khouja M., and Vergara F.E. Use of genetic algorithms to solve production and operations management problems: A review. International Journal of Production Research 41 17 (2003) 3955-4009
    • (2003) International Journal of Production Research , vol.41 , Issue.17 , pp. 3955-4009
    • Aytug, H.1    Khouja, M.2    Vergara, F.E.3
  • 3
    • 0242269826 scopus 로고    scopus 로고
    • Measures of subproblem criticality in decomposition algorithms for shop scheduling
    • Aytug H., Kempf K., and Uzsoy R. Measures of subproblem criticality in decomposition algorithms for shop scheduling. International Journal of Production Research 41 5 (2002) 865-882
    • (2002) International Journal of Production Research , vol.41 , Issue.5 , pp. 865-882
    • Aytug, H.1    Kempf, K.2    Uzsoy, R.3
  • 4
    • 0031506199 scopus 로고    scopus 로고
    • Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
    • Chand S., Traub R., and Uzsoy R. Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. Annals of Operations Research 70 (1997) 115-125
    • (1997) Annals of Operations Research , vol.70 , pp. 115-125
    • Chand, S.1    Traub, R.2    Uzsoy, R.3
  • 5
    • 0031542280 scopus 로고    scopus 로고
    • A computational study of shifting bottleneck procedures for shop scheduling problems
    • Demirkol E., Metha S., and Uzsoy R. A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics 3 (1997) 111-137
    • (1997) Journal of Heuristics , vol.3 , pp. 111-137
    • Demirkol, E.1    Metha, S.2    Uzsoy, R.3
  • 6
    • 0000332876 scopus 로고    scopus 로고
    • Decomposition methods for reentrant flow shops with sequence dependent setup-times
    • Demirkol E., and Uszoy R. Decomposition methods for reentrant flow shops with sequence dependent setup-times. Journal of Scheduling 3 (2000) 155-177
    • (2000) Journal of Scheduling , vol.3 , pp. 155-177
    • Demirkol, E.1    Uszoy, R.2
  • 7
    • 0034229139 scopus 로고    scopus 로고
    • Recent development in evolutionary computation for manufacturing optimization: Problems, solutions and comparisons
    • Dimopoulos C., and Zalzala A.M.S. Recent development in evolutionary computation for manufacturing optimization: Problems, solutions and comparisons. IEEE Transactions on Evolutionary Computation 4 2 (2000) 93-113
    • (2000) IEEE Transactions on Evolutionary Computation , vol.4 , Issue.2 , pp. 93-113
    • Dimopoulos, C.1    Zalzala, A.M.S.2
  • 8
    • 0030415771 scopus 로고    scopus 로고
    • M.K. El Adl, A.A. Rodriguez, K.S. Tsakalis, Hierarchical modeling and control of re-entrant semiconductor manufacturing facilities, in: Proceedings of the 35th Conference on Decision and Control, Kobe, Japan, 1996.
  • 10
    • 0013414351 scopus 로고    scopus 로고
    • A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups
    • Fowler J.W., Horng S., and Cochran J.K. A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups. International Journal of Manufacturing Technology and Management 1-2 9 (2000) 156-172
    • (2000) International Journal of Manufacturing Technology and Management , vol.1-2 , Issue.9 , pp. 156-172
    • Fowler, J.W.1    Horng, S.2    Cochran, J.K.3
  • 13
    • 77957077792 scopus 로고
    • A "pseudopolynomial" time algorithm for sequencing jobs to minimize total weighted tardiness
    • Lawler E.L. A "pseudopolynomial" time algorithm for sequencing jobs to minimize total weighted tardiness. Annals of Discrete Mathematics 1 (1977) 331-342
    • (1977) Annals of Discrete Mathematics , vol.1 , pp. 331-342
    • Lawler, E.L.1
  • 14
    • 0042311378 scopus 로고    scopus 로고
    • Scheduling unrelated parallel machines to minimize total weighted tardiness
    • Liaw C.-F., Lin Y.-K., Cheng C.-Y., and Chen M. Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers & Operations Research 30 (2003) 1777-1789
    • (2003) Computers & Operations Research , vol.30 , pp. 1777-1789
    • Liaw, C.-F.1    Lin, Y.-K.2    Cheng, C.-Y.3    Chen, M.4
  • 15
    • 0042622980 scopus 로고    scopus 로고
    • A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
    • Mason S.J., Fowler J.W., and Carlyle W.M. A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling 5 3 (2002) 247-262
    • (2002) Journal of Scheduling , vol.5 , Issue.3 , pp. 247-262
    • Mason, S.J.1    Fowler, J.W.2    Carlyle, W.M.3
  • 17
    • 33750739418 scopus 로고    scopus 로고
    • L. Mönch, Minimizing total weighted tardiness of jobs with unequal ready times on parallel machines, in: Proceedings of 11th Industrial Engineering Research Conference, Portland Oregon, 2003.
  • 19
    • 13844256873 scopus 로고    scopus 로고
    • Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
    • Mönch L., Balasubramanian H., Fowler J.W., and Pfund M.E. Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers & Operations Research 32 (2005) 2731-2750
    • (2005) Computers & Operations Research , vol.32 , pp. 2731-2750
    • Mönch, L.1    Balasubramanian, H.2    Fowler, J.W.3    Pfund, M.E.4
  • 20
    • 33750729791 scopus 로고    scopus 로고
    • L. Mönch, O. Rose, Shifting-Bottleneck-Heuristik für komplexe Produktionssysteme: Softwaretechnische Realisierung und Leistungsbewertung, in: Proceedings Multi-Konferenz Wirtschaftsinformatik, Teilkonferenz, Quantitative Methoden in ERP und SCM", DSOR Contributions to Information Systems, vol. 2, 2004, pp. 145-159.
  • 21
    • 0029404198 scopus 로고
    • Rolling horizon procedures for dynamic parallel machine scheduling with sequence dependent setup times
    • Ovacik I.M., and Uzsoy R. Rolling horizon procedures for dynamic parallel machine scheduling with sequence dependent setup times. International Journal of Production Research 33 (1995) 3173-3292
    • (1995) International Journal of Production Research , vol.33 , pp. 3173-3292
    • Ovacik, I.M.1    Uzsoy, R.2
  • 23
    • 33750693243 scopus 로고    scopus 로고
    • D. Pabst, Handling precedence constraints for the shifting bottleneck heuristic applied in a dynamic semiconductor manufacturing environment, Master thesis, Universität Würzburg, 2003.
  • 24
    • 24644516597 scopus 로고    scopus 로고
    • A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems
    • Pfund M.E., Fowler J.W., and Gupta J.N.D. A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems. Journal of the Chinese Institute of Industrial Engineers 21 3 (2004) 230-241
    • (2004) Journal of the Chinese Institute of Industrial Engineers , vol.21 , Issue.3 , pp. 230-241
    • Pfund, M.E.1    Fowler, J.W.2    Gupta, J.N.D.3
  • 25
    • 0033079535 scopus 로고    scopus 로고
    • A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
    • Pinedo M., and Singer A. A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics 46 (1999) 1-17
    • (1999) Naval Research Logistics , vol.46 , pp. 1-17
    • Pinedo, M.1    Singer, A.2
  • 28
    • 33750706780 scopus 로고    scopus 로고
    • A. Schömig, J.W. Fowler, Modelling semiconductor manufacturing operations, in: K. Mertins, M. Rabe (Eds.), Proceedings of the 9th ASIM Dedicated Conference Simulation in Production and Logistics, 2000, pp. 55-64.
  • 29
    • 84952240555 scopus 로고
    • A review of production planning and scheduling models in the semiconductor industry, Part I: System characteristics, performance evaluation and production planning
    • Uzsoy R., Lee C.-Y., and Martin-Vega L.A. A review of production planning and scheduling models in the semiconductor industry, Part I: System characteristics, performance evaluation and production planning. IIE Transactions on Scheduling and Logistics 24 (1992) 47-61
    • (1992) IIE Transactions on Scheduling and Logistics , vol.24 , pp. 47-61
    • Uzsoy, R.1    Lee, C.-Y.2    Martin-Vega, L.A.3
  • 30
    • 0023399009 scopus 로고
    • Priority rules for job shops with weighted tardiness costs
    • Vepsalainen A.P.J., and Morton T.E. Priority rules for job shops with weighted tardiness costs. Management Science 33 8 (1987) 1035-1047
    • (1987) Management Science , vol.33 , Issue.8 , pp. 1035-1047
    • Vepsalainen, A.P.J.1    Morton, T.E.2
  • 31
    • 33750681512 scopus 로고    scopus 로고
    • M. Wall, Galib: A C++ library of genetic algorithms components, 1999. Available from: .


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