메뉴 건너뛰기




Volumn 15, Issue 4, 2008, Pages 349-359

Artificial neural networks for finite capacity scheduling: A comparative study

Author keywords

Artificial neural networks; Branch and bound algorithm; Finite capacity scheduling

Indexed keywords

BRANCH AND BOUND METHOD; JOB SHOP SCHEDULING; NEURAL NETWORKS; SCHEDULING;

EID: 77749317484     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (8)

References (34)
  • 1
    • 0031189321 scopus 로고    scopus 로고
    • Finite-capacity scheduling-based planning for revenue-based capacity management
    • Akkan, C. (1997). Finite-Capacity Scheduling-Based Planning for Revenue-Based Capacity Management. European Journal of Operational Research, 100: 170-179.
    • (1997) European Journal of Operational Research , vol.100 , pp. 170-179
    • Akkan, C.1
  • 2
    • 33144464479 scopus 로고    scopus 로고
    • A decision support system for production scheduling in an ion plating cell
    • Chan, F.T.S., Au, K.C. and Chan, P.L.Y. (2006). A Decision Support System for Production Scheduling in an Ion Plating Cell. Expert Systems with Applications, 30: 1-12.
    • (2006) Expert Systems with Applications , vol.30 , pp. 1-12
    • Chan, F.T.S.1    Au, K.C.2    Chan, P.L.Y.3
  • 3
    • 0031075891 scopus 로고    scopus 로고
    • A Branch-and-Bound Algorithm with Fuzzy Inference for a permutation flowshop scheduling problem
    • Cheng, J., Kise, H. and Matsumoto, H. (1997). A Branch-and-Bound Algorithm with Fuzzy Inference for a Permutation Flowshop Scheduling Problem. European Journal of Operational Research, 96 (3): 578-590.
    • (1997) European Journal of Operational Research , vol.96 , Issue.3 , pp. 578-590
    • Cheng, J.1    Kise, H.2    Matsumoto, H.3
  • 4
  • 6
    • 0026899732 scopus 로고
    • A constructive method for multivariate function approximation by multilayer perceptrons
    • Geva, S., Sitte, J. (1992). A Constructive Method for Multivariate Function Approximation by Multilayer Perceptrons. IEEE Transactions on Neural Networks, 3(4): 621-624.
    • (1992) IEEE Transactions on Neural Networks , vol.3 , Issue.4 , pp. 621-624
    • Geva, S.1    Sitte, J.2
  • 11
    • 1842762122 scopus 로고    scopus 로고
    • Approximation schemes for parallel machine scheduling problems with controllable processing times
    • Jansen, K. and Mastrolilli, M. (2004). Approximation Schemes for Parallel Machine Scheduling Problems with Controllable Processing Times. Computers and Operations Research, 31: 1565-1581.
    • (2004) Computers and Operations Research , vol.31 , pp. 1565-1581
    • Jansen, K.1    Mastrolilli, M.2
  • 12
    • 33644884301 scopus 로고    scopus 로고
    • Technical Report C/TR96-05. Dept. of Computing, Macquarie University
    • Jondarr, C.G.H. (1996). Back Propagation Family Album. Technical Report C/TR96-05. Dept. of Computing, Macquarie University.
    • (1996) Back Propagation Family Album
    • Jondarr, C.G.H.1
  • 13
    • 0025488846 scopus 로고
    • The electronic leitstand: A new tool for shop scheduling
    • Kanet, J.J. and Sridharan, V. (1990). The Electronic Leitstand: A New Tool for Shop Scheduling. Manufacturing Review, 3(3): 161-170.
    • (1990) Manufacturing Review , vol.3 , Issue.3 , pp. 161-170
    • Kanet, J.J.1    Sridharan, V.2
  • 15
    • 0017908060 scopus 로고
    • A general bounding scheme for the permutation flowshop problem
    • Lageweg, B.J., Lenstra, J.K. and Rirmooy Kan, A.H.G. (1978). A General Bounding Scheme for the Permutation Flowshop Problem. Operations Research, 26: 53-67.
    • (1978) Operations Research , vol.26 , pp. 53-67
    • Lageweg, B.J.1    Lenstra, J.K.2    Rirmooy Kan, A.H.G.3
  • 16
    • 0023331258 scopus 로고
    • An introduction to computing with neural nets
    • Lippmann, R.P. (1987). An Introduction to Computing with Neural Nets. IEEE ASSP Magazine: 4-22.
    • (1987) IEEE ASSP Magazine , pp. 4-22
    • Lippmann, R.P.1
  • 17
    • 0025433556 scopus 로고
    • Medium to short term l-mite capacity scheduling: A planning methodology for capacity constrained workshops
    • McCarthy, S.W. and Barber, K.D. (1990). Medium to Short Term l-Mite Capacity Scheduling: A Planning Methodology for Capacity Constrained Workshops. Engineering Costs and Production Economics, 19: 189-199.
    • (1990) Engineering Costs and Production Economics , vol.19 , pp. 189-199
    • McCarthy, S.W.1    Barber, K.D.2
  • 19
    • 0036642688 scopus 로고    scopus 로고
    • Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain
    • Moon, C., Kim, J. and Hur, S. (2002). Integrated Process Planning and Scheduling with Minimizing Total Tardiness in Multi-Plants Supply Chain. Computers and Industrial Engineering, 43: 331-349.
    • (2002) Computers and Industrial Engineering , vol.43 , pp. 331-349
    • Moon, C.1    Kim, J.2    Hur, S.3
  • 20
    • 0141636312 scopus 로고    scopus 로고
    • The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure
    • Pongcharoen, P., Hicks, C. and Braiden, P.M. (2004). The Development of Genetic Algorithms for the Finite Capacity Scheduling of Complex Products, with Multiple Levels of Product Structure. European Journal of Operational Research, 152: 215-225.
    • (2004) European Journal of Operational Research , vol.152 , pp. 215-225
    • Pongcharoen, P.1    Hicks, C.2    Braiden, P.M.3
  • 21
    • 1842762099 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
    • Rabadi, G., Mollaghasemi, M. and Anagnostopoulos, G.C. (2004). A Branch-and-Bound Algorithm for the Early/Tardy Machine Scheduling Problem with a Common Due-Date and Sequence-Dependent Setup Time. Computers and Operations Research, 31(10): 1727-1751.
    • (2004) Computers and Operations Research , vol.31 , Issue.10 , pp. 1727-1751
    • Rabadi, G.1    Mollaghasemi, M.2    Anagnostopoulos, G.C.3
  • 25
    • 0031095462 scopus 로고    scopus 로고
    • Predictive capacity planning: A proactive approach
    • Sia, C.-L. and Ho, Y.-S. (1997). Predictive Capacity Planning: A Proactive Approach. Information and Software Technology, 39: 195-204.
    • (1997) Information and Software Technology , vol.39 , pp. 195-204
    • Sia, C.-L.1    Ho, Y.-S.2
  • 27
    • 0031220255 scopus 로고    scopus 로고
    • Diagnostic scheduling in finite-capacity production environments
    • Tardif, V. and Spearman, M.L. (1997). Diagnostic Scheduling in Finite-Capacity Production Environments. Computers and Industrial Engineering, 32 (4): 867-878.
    • (1997) Computers and Industrial Engineering , vol.32 , Issue.4 , pp. 867-878
    • Tardif, V.1    Spearman, M.L.2
  • 28
    • 33644886074 scopus 로고    scopus 로고
    • Economic analysis of risky projects by artificial neural networks
    • Taskin, A. and Guneri, A.F. (2006). Economic Analysis of Risky Projects by Artificial Neural Networks. Applied Mathematics and Computation, 175 (1): 171-181.
    • (2006) Applied Mathematics and Computation , vol.175 , Issue.1 , pp. 171-181
    • Taskin, A.1    Guneri, A.F.2
  • 29
    • 26844467313 scopus 로고    scopus 로고
    • A hybrid method for solving stochastic job shop scheduling problems
    • DOI 10.1016/j.amc.2004.11.036, PII S0096300304009178
    • Tavakkoli-Moghaddam, R., Jolai, F., Vaziri, F., Ahmed, P.K. and Azaron, A. (2005). A Hybrid Method for Solving Stochastic Job Shop Scheduling Problems. Applied Mathematics and Computation, 170: 185-206. (Pubitemid 41454805)
    • (2005) Applied Mathematics and Computation , vol.170 , Issue.1 , pp. 185-206
    • Tavakkoli-Moghaddam, R.1    Jolai, F.2    Vaziri, F.3    Ahmed, P.K.4    Azaron, A.5
  • 31
    • 15344343721 scopus 로고    scopus 로고
    • A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem
    • Watanabe, M., Ida, K. and Gen, M. (2005). A Genetic Algorithm with Modified Crossover Operator and Search Area Adaptation for the Job-Shop Scheduling Problem. Computers and Industrial Engineering, 48: 743-752.
    • (2005) Computers and Industrial Engineering , vol.48 , pp. 743-752
    • Watanabe, M.1    Ida, K.2    Gen, M.3
  • 32
    • 0035452563 scopus 로고    scopus 로고
    • A new adaptive neural network and heuristics hybrid approach for job-shop scheduling
    • Yang, S. and Wang, D. (2001). A New Adaptive Neural Network and Heuristics Hybrid Approach for Job-Shop Scheduling. Computers and Operations Research, 28: 955-971.
    • (2001) Computers and Operations Research , vol.28 , pp. 955-971
    • Yang, S.1    Wang, D.2


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