메뉴 건너뛰기




Volumn 90, Issue , 2015, Pages 12-24

A genetic algorithm for permutation flow shop scheduling under make to stock production system

Author keywords

Economic lot scheduling; Genetic algorithm; Make to stock production; Permutation flow shop scheduling

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; MACHINE SHOP PRACTICE; MANUFACTURE; OPTIMIZATION; SCHEDULING;

EID: 84941561778     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2015.08.006     Document Type: Article
Times cited : (52)

References (49)
  • 1
    • 3342903540 scopus 로고    scopus 로고
    • A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation
    • S. Bertel, and J.C. Billaut A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation European Journal of Operational Research 159 3 2004 651 662
    • (2004) European Journal of Operational Research , vol.159 , Issue.3 , pp. 651-662
    • Bertel, S.1    Billaut, J.C.2
  • 2
    • 0000326705 scopus 로고
    • A dynamic programming approach to a lot size scheduling problem
    • E.E. Bomberger A dynamic programming approach to a lot size scheduling problem Management Science 12 11 1966 778 784
    • (1966) Management Science , vol.12 , Issue.11 , pp. 778-784
    • Bomberger, E.E.1
  • 3
    • 84892922007 scopus 로고    scopus 로고
    • An artificial bee colony algorithm for the economic lot scheduling problem
    • O. Bulut, and M.F. Tasgetiren An artificial bee colony algorithm for the economic lot scheduling problem International Journal of Production Research 52 4 2014 1150 1170
    • (2014) International Journal of Production Research , vol.52 , Issue.4 , pp. 1150-1170
    • Bulut, O.1    Tasgetiren, M.F.2
  • 4
    • 33847643247 scopus 로고    scopus 로고
    • The economic lot scheduling problem: A pure genetic search approach
    • D.C. Chatfield The economic lot scheduling problem: A pure genetic search approach Computers & Operations Research 34 10 2007 2865 2881
    • (2007) Computers & Operations Research , vol.34 , Issue.10 , pp. 2865-2881
    • Chatfield, D.C.1
  • 5
    • 79959452256 scopus 로고
    • Simulated binary crossover for continuous search space
    • K. Deb, and R.B. Agrawal Simulated binary crossover for continuous search space Complex Systems 9 3 1994 1 15
    • (1994) Complex Systems , vol.9 , Issue.3 , pp. 1-15
    • Deb, K.1    Agrawal, R.B.2
  • 7
    • 0017931081 scopus 로고
    • The economic lot scheduling problem (ELSP): Review and extensions
    • S.E. Elmaghraby The economic lot scheduling problem (ELSP): Review and extensions Management Science 24 6 1978 587 598
    • (1978) Management Science , vol.24 , Issue.6 , pp. 587-598
    • Elmaghraby, S.E.1
  • 8
    • 0028769450 scopus 로고
    • A job-splitting heuristic for lot-size scheduling in multi-stage, multi-product production processes
    • M. El-Najdawi A job-splitting heuristic for lot-size scheduling in multi-stage, multi-product production processes European Journal of Operational Research 75 2 1994 365 377
    • (1994) European Journal of Operational Research , vol.75 , Issue.2 , pp. 365-377
    • El-Najdawi, M.1
  • 9
    • 0031375935 scopus 로고    scopus 로고
    • Multi-cyclic flow shop scheduling: An application in multi-stage, multiproduct production processes
    • M. El-Najdawi Multi-cyclic flow shop scheduling: An application in multi-stage, multiproduct production processes International Journal of Production Research 35 12 1997 3323 3332
    • (1997) International Journal of Production Research , vol.35 , Issue.12 , pp. 3323-3332
    • El-Najdawi, M.1
  • 10
    • 0023643533 scopus 로고
    • Use of operations research in production management
    • F.N. Ford, and D. Bradbard Use of operations research in production management Production and Inventory Management 28 3 1987 59 63
    • (1987) Production and Inventory Management , vol.28 , Issue.3 , pp. 59-63
    • Ford, F.N.1    Bradbard, D.2
  • 11
    • 79952624870 scopus 로고    scopus 로고
    • An efficient memetic algorithm for solving the job shop scheduling problem
    • L. Gao, G. Zhang, L. Zhang, and X. Li An efficient memetic algorithm for solving the job shop scheduling problem Computers & Industrial Engineering 60 4 2011 699 705
    • (2011) Computers & Industrial Engineering , vol.60 , Issue.4 , pp. 699-705
    • Gao, L.1    Zhang, G.2    Zhang, L.3    Li, X.4
  • 13
    • 0019585243 scopus 로고
    • A review of production scheduling
    • S.C. Graves A review of production scheduling Operations Research 29 4 1981 646 675
    • (1981) Operations Research , vol.29 , Issue.4 , pp. 646-675
    • Graves, S.C.1
  • 15
    • 0020587837 scopus 로고
    • On the general feasibility test of scheduling lot sizes for several products on one machine
    • W.L. Hsu On the general feasibility test of scheduling lot sizes for several products on one machine Management Science 29 1 1983 93 105
    • (1983) Management Science , vol.29 , Issue.1 , pp. 93-105
    • Hsu, W.L.1
  • 17
    • 34250824923 scopus 로고    scopus 로고
    • A new algorithm for determining production schedules when solving the multi-product economic lot sizing problem in flow shops
    • J.-Y. Huang, and M.-J. Yao A new algorithm for determining production schedules when solving the multi-product economic lot sizing problem in flow shops The International Journal of Advanced Manufacturing Technology 33 5-6 2007 560 578
    • (2007) The International Journal of Advanced Manufacturing Technology , vol.33 , Issue.5-6 , pp. 560-578
    • Huang, J.-Y.1    Yao, M.-J.2
  • 18
    • 46149100311 scopus 로고    scopus 로고
    • A genetic algorithm for solving the economic lot scheduling problem in flow shops
    • J.-Y. Huang, and M.-J. Yao A genetic algorithm for solving the economic lot scheduling problem in flow shops International Journal of Production Research 46 14 2008 3737 3761
    • (2008) International Journal of Production Research , vol.46 , Issue.14 , pp. 3737-3761
    • Huang, J.-Y.1    Yao, M.-J.2
  • 19
    • 0000177367 scopus 로고
    • Application of the branch and bound technique to some flow-shop scheduling problems
    • E. Ignall, and L. Schrage Application of the branch and bound technique to some flow-shop scheduling problems Operations Research 13 3 1965 400 412
    • (1965) Operations Research , vol.13 , Issue.3 , pp. 400-412
    • Ignall, E.1    Schrage, L.2
  • 20
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1 1954 61 68
    • (1954) Naval Research Logistics Quarterly , vol.1 , Issue.1 , pp. 61-68
    • Johnson, S.M.1
  • 23
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
    • M. Nawaz, E. Enscore, and I. Ham A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem Omega 11 1 1983 91 95
    • (1983) Omega , vol.11 , Issue.1 , pp. 91-95
    • Nawaz, M.1    Enscore, E.2    Ham, I.3
  • 24
    • 38249025037 scopus 로고
    • Simulated annealing for permutation flow-shop scheduling
    • I.H. Osman, and C.N. Potts Simulated annealing for permutation flow-shop scheduling Omega 17 6 1989 551 557
    • (1989) Omega , vol.17 , Issue.6 , pp. 551-557
    • Osman, I.H.1    Potts, C.N.2
  • 25
    • 0032050798 scopus 로고    scopus 로고
    • Sequencing, lot sizing and scheduling of several products in job shops: The common cycle approach
    • 1998/04/01
    • J. Ouenniche, and F. Boctor Sequencing, lot sizing and scheduling of several products in job shops: The common cycle approach International Journal of Production Research 36 4 1998 1125 1140 1998/04/01
    • (1998) International Journal of Production Research , vol.36 , Issue.4 , pp. 1125-1140
    • Ouenniche, J.1    Boctor, F.2
  • 26
    • 0035283825 scopus 로고    scopus 로고
    • The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops
    • J. Ouenniche, and F.F. Boctor The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops European Journal of Operational Research 129 3 2001 539 554
    • (2001) European Journal of Operational Research , vol.129 , Issue.3 , pp. 539-554
    • Ouenniche, J.1    Boctor, F.F.2
  • 27
    • 0035480299 scopus 로고    scopus 로고
    • The multi-product, economic lot-sizing problem in flow shops: The powers-of-two heuristic
    • J. Ouenniche, and F.F. Boctor The multi-product, economic lot-sizing problem in flow shops: The powers-of-two heuristic Computers & Operations Research 28 12 2001 1165 1182
    • (2001) Computers & Operations Research , vol.28 , Issue.12 , pp. 1165-1182
    • Ouenniche, J.1    Boctor, F.F.2
  • 28
    • 55449124245 scopus 로고    scopus 로고
    • A discrete differential evolution algorithm for the permutation flowshop scheduling problem
    • Q.-K. Pan, M.F. Tasgetiren, and Y.-C. Liang A discrete differential evolution algorithm for the permutation flowshop scheduling problem Computers & Industrial Engineering 55 4 2008 795 816
    • (2008) Computers & Industrial Engineering , vol.55 , Issue.4 , pp. 795-816
    • Pan, Q.-K.1    Tasgetiren, M.F.2    Liang, Y.-C.3
  • 29
    • 0031145735 scopus 로고    scopus 로고
    • An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs
    • S. Parthasarathy, and C. Rajendran An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs International Journal of Production Economics 49 3 1997 255 263
    • (1997) International Journal of Production Economics , vol.49 , Issue.3 , pp. 255-263
    • Parthasarathy, S.1    Rajendran, C.2
  • 32
    • 84938750556 scopus 로고    scopus 로고
    • A real-time order acceptance and scheduling approach for permutation flow shop problems
    • H.F. Rahman, R. Sarker, and D. Essam A real-time order acceptance and scheduling approach for permutation flow shop problems European Journal of Operational Research 247 2 2015 488 503
    • (2015) European Journal of Operational Research , vol.247 , Issue.2 , pp. 488-503
    • Rahman, H.F.1    Sarker, R.2    Essam, D.3
  • 33
    • 1642559633 scopus 로고    scopus 로고
    • Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
    • C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs European Journal of Operational Research 155 2 2004 426 438
    • (2004) European Journal of Operational Research , vol.155 , Issue.2 , pp. 426-438
    • Rajendran, C.1    Ziegler, H.2
  • 34
    • 44649152898 scopus 로고    scopus 로고
    • A comparative study of heuristic algorithms on economic lot scheduling problem
    • A.S. Raza, and A. Akgunduz A comparative study of heuristic algorithms on economic lot scheduling problem Computers & Industrial Engineering 55 1 2008 94 109
    • (2008) Computers & Industrial Engineering , vol.55 , Issue.1 , pp. 94-109
    • Raza, A.S.1    Akgunduz, A.2
  • 35
    • 0029224965 scopus 로고
    • A genetic algorithm for flowshop sequencing
    • C.R. Reeves A genetic algorithm for flowshop sequencing Computers & Operations Research 22 1 1995 5 13
    • (1995) Computers & Operations Research , vol.22 , Issue.1 , pp. 5-13
    • Reeves, C.R.1
  • 36
    • 0031212608 scopus 로고    scopus 로고
    • Flowshop scheduling/sequencing research: A statistical review of the literature, 1952-1994
    • A. Reisman, A. Kumar, and J. Motwani Flowshop scheduling/sequencing research: A statistical review of the literature, 1952-1994 IEEE Transactions on Engineering Management 44 3 1997 316 329
    • (1997) IEEE Transactions on Engineering Management , vol.44 , Issue.3 , pp. 316-329
    • Reisman, A.1    Kumar, A.2    Motwani, J.3
  • 37
    • 0001753360 scopus 로고
    • A computational approach to the economic lot scheduling problem
    • J. Rogers A computational approach to the economic lot scheduling problem Management Science 4 3 1958 264 291
    • (1958) Management Science , vol.4 , Issue.3 , pp. 264-291
    • Rogers, J.1
  • 38
    • 13444251134 scopus 로고    scopus 로고
    • A comprehensive review and evaluation of permutation flowshop heuristics
    • R. Ruiz, and C. Maroto A comprehensive review and evaluation of permutation flowshop heuristics European Journal of Operational Research 165 2 2005 479 494
    • (2005) European Journal of Operational Research , vol.165 , Issue.2 , pp. 479-494
    • Ruiz, R.1    Maroto, C.2
  • 40
    • 34548625026 scopus 로고    scopus 로고
    • Modeling realistic hybrid flexible flowshop scheduling problems
    • R. Ruiz, F.S. Serifoglu, and T. Urlings Modeling realistic hybrid flexible flowshop scheduling problems Computers & Operations Research 35 4 2008 1151 1175
    • (2008) Computers & Operations Research , vol.35 , Issue.4 , pp. 1151-1175
    • Ruiz, R.1    Serifoglu, F.S.2    Urlings, T.3
  • 41
    • 33750841084 scopus 로고    scopus 로고
    • A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
    • R. Ruiz, and T. Stutzle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 177 3 2007 2033 2049
    • (2007) European Journal of Operational Research , vol.177 , Issue.3 , pp. 2033-2049
    • Ruiz, R.1    Stutzle, T.2
  • 43
    • 0022905665 scopus 로고
    • A mixed-integer goal-programming formulation of the standard flow-shop scheduling problem
    • W.J. Selen, and D.D. Hott A mixed-integer goal-programming formulation of the standard flow-shop scheduling problem Journal of the Operational Research Society 37 12 1986 1121 1128
    • (1986) Journal of the Operational Research Society , vol.37 , Issue.12 , pp. 1121-1128
    • Selen, W.J.1    Hott, D.D.2
  • 45
    • 71549162556 scopus 로고    scopus 로고
    • A genetic algorithm for the economic lot scheduling problem under the extended basic period and power-of-two policy
    • H. Sun, H.-C. Huang, and W. Jaruphongsa A genetic algorithm for the economic lot scheduling problem under the extended basic period and power-of-two policy CIRP Journal of Manufacturing Science and Technology 2 1 2009 29 34
    • (2009) CIRP Journal of Manufacturing Science and Technology , vol.2 , Issue.1 , pp. 29-34
    • Sun, H.1    Huang, H.-C.2    Jaruphongsa, W.3
  • 46
    • 0025700701 scopus 로고
    • Some efficient heuristic methods for the flow-shop sequencing problem
    • E. Taillard Some efficient heuristic methods for the flow-shop sequencing problem European Journal of Operational Research 47 1 1990 65 74
    • (1990) European Journal of Operational Research , vol.47 , Issue.1 , pp. 65-74
    • Taillard, E.1
  • 47
    • 33751236810 scopus 로고    scopus 로고
    • A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
    • M.F. Tasgetiren, Y.-C. Liang, M. Sevkli, and G. Gencyilmaz A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem European Journal of Operational Research 177 3 2007 1930 1947
    • (2007) European Journal of Operational Research , vol.177 , Issue.3 , pp. 1930-1947
    • Tasgetiren, M.F.1    Liang, Y.-C.2    Sevkli, M.3    Gencyilmaz, G.4
  • 49
    • 54449086192 scopus 로고    scopus 로고
    • Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
    • G.I. Zobolas, C.D. Tarantilis, and G. Ioannou Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm Computers & Operations Research 36 4 2009 1249 1267
    • (2009) Computers & Operations Research , vol.36 , Issue.4 , pp. 1249-1267
    • Zobolas, G.I.1    Tarantilis, C.D.2    Ioannou, G.3


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