메뉴 건너뛰기




Volumn 1, Issue , 2011, Pages 59-64

Optimisation of precedence-constrained production sequencing and scheduling using genetic algorithms

Author keywords

Cutting operation; Genetic algorithm; Optimisation; Precedence constrained sequencing and scheduling

Indexed keywords

CUTTING OPERATIONS; HANDLING CONSTRAINTS; MANUFACTURING ENVIRONMENTS; MUTATION OPERATIONS; NOVEL STRATEGIES; OPTIMISATION; OPTIMISATIONS; SEQUENCING AND SCHEDULING; VARIABLE LENGTH CHROMOSOME;

EID: 79960595308     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (21)
  • 1
    • 0028754025 scopus 로고
    • Performance evaluation of scheduling precedence-constrained computations on message-passing systems
    • AL-MOUHAMED, M. and AL-MAASARANI, A. 1994. Performance evaluation of scheduling precedence-constrained computations on message-passing systems. Parallel and Distributed Systems, IEEE Transactions on 5, 1317-1321.
    • (1994) Parallel and Distributed Systems, IEEE Transactions on , vol.5 , pp. 1317-1321
    • Al-Mouhamed, M.1    Al-Maasarani, A.2
  • 2
    • 33750705907 scopus 로고    scopus 로고
    • Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
    • Springer Berlin / Heidelberg
    • AZAR, Y., ERLEBACH, T., AMBUHL, C. and MASTROLILLI, M. 2006. Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. In Algorithms - ESA 2006 Springer Berlin / Heidelberg, 28-39.
    • (2006) Algorithms - ESA 2006 , pp. 28-39
    • Azar, Y.1    Erlebach, T.2    Ambuhl, C.3    Mastrolilli, M.4
  • 3
    • 0001808449 scopus 로고    scopus 로고
    • Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
    • CHEKURI, C. and MOTWANI, R. 1999. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics 98, 29-38.
    • (1999) Discrete Applied Mathematics , vol.98 , pp. 29-38
    • Chekuri, C.1    Motwani, R.2
  • 5
    • 1142280337 scopus 로고    scopus 로고
    • Precedence constrained TSP arising in printed circuit board assembly
    • DUMAN, E. and OR, I. 2004. Precedence constrained TSP arising in printed circuit board assembly. International Journal of Production Research 42, 67-78.
    • (2004) International Journal of Production Research , vol.42 , pp. 67-78
    • Duman, E.1    Or, I.2
  • 8
    • 0033171346 scopus 로고    scopus 로고
    • Precedence-constrained task allocation onto point-to-point networks for pipelined execution
    • HARY, S.L. and OZGUNER, F. 1999. Precedence-constrained task allocation onto point-to-point networks for pipelined execution. Parallel and Distributed Systems, IEEE Transactions on 10, 838-851.
    • (1999) Parallel and Distributed Systems, IEEE Transactions on 10 , pp. 838-851
    • Hary, S.L.1    Ozguner, F.2
  • 9
    • 0026907761 scopus 로고
    • Scheduling manufacturing systems
    • HE, W. and KUSIAK, A. 1992. Scheduling manufacturing systems. Computers in Industry 20, 163-175.
    • (1992) Computers in Industry , vol.20 , pp. 163-175
    • He, W.1    Kusiak, A.2
  • 11
    • 31044454520 scopus 로고    scopus 로고
    • Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs
    • LAMBERT, A.J.D. 2006. Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs. Omega 34, 538-549.
    • (2006) Omega , vol.34 , pp. 538-549
    • Lambert, A.J.D.1
  • 13
    • 15844375543 scopus 로고    scopus 로고
    • Assembly Sequence Planning and Optimisation Using Genetic Algorithms. Part I: Automatic Generation of Feasible Assembly Sequences
    • MARIAN, R.M., LUONG, L.H.S. and ABHARY, K. 2003. Assembly Sequence Planning and Optimisation Using Genetic Algorithms. Part I: Automatic Generation of Feasible Assembly Sequences. Applied Soft Computing, 223-253.
    • (2003) Applied Soft Computing , pp. 223-253
    • Marian, R.M.1    Luong, L.H.S.2    Abhary, K.3
  • 15
    • 0036680981 scopus 로고    scopus 로고
    • An efficient genetic algorithm for the traveling salesman problem with precedence constraints
    • MOON, C., KIM, J., CHOI, G. and SEO, Y. 2002. An efficient genetic algorithm for the traveling salesman problem with precedence constraints. European Journal of Operational Research 140, 606-617.
    • (2002) European Journal of Operational Research , vol.140 , pp. 606-617
    • Moon, C.1    Kim, J.2    Choi, G.3    Seo, Y.4
  • 16
    • 79960605492 scopus 로고
    • Algoristics for Single-Machine Sequencing with Precedence Constraints
    • MORTON, T.E. and DHARAN, B.G. 1978. Algoristics for Single-Machine Sequencing with Precedence Constraints. Management science 24, 9.
    • (1978) Management Science , vol.24 , pp. 9
    • Morton, T.E.1    Dharan, B.G.2
  • 17
    • 0028397097 scopus 로고
    • Scheduling precedence constrained task graphs with non-negligible intertask communication onto multiprocessors
    • SELVAKUMAR, S. and SIVA RAM MURTHY, C. 1994. Scheduling precedence constrained task graphs with non-negligible intertask communication onto multiprocessors. Parallel and Distributed Systems, IEEE Transactions on 5, 328-336.
    • (1994) Parallel and Distributed Systems, IEEE Transactions on , vol.5 , pp. 328-336
    • Selvakumar, S.1    Siva Ram Murthy, C.2
  • 18
    • 84907421515 scopus 로고    scopus 로고
    • Applying case-based reasoning in assembly sequence planning
    • SU, Q. 2007. Applying case-based reasoning in assembly sequence planning. International Journal of Production Research 45, 29-47.
    • (2007) International Journal of Production Research , vol.45 , pp. 29-47
    • Su, Q.1
  • 20
    • 79960570474 scopus 로고    scopus 로고
    • Genetic algorithm approach for precedence-constrained sequencing problems
    • YUN, Y. and MOON, C. 2009. Genetic algorithm approach for precedence-constrained sequencing problems. Journal of Intelligent Manufacturing, 1-10.
    • (2009) Journal of Intelligent Manufacturing , pp. 1-10
    • Yun, Y.1    Moon, C.2
  • 21
    • 79960597997 scopus 로고    scopus 로고
    • Solving 0-1 knapsack problem by a novel global harmony search algorithm
    • In Press, Corrected Proof
    • ZOU, D., GAO, L., LI, S. and WU, J. Solving 0-1 knapsack problem by a novel global harmony search algorithm. Applied Soft Computing In Press, Corrected Proof.
    • Applied Soft Computing
    • Zou, D.1    Gao, L.2    Li, S.3    Wu, J.4


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