메뉴 건너뛰기
International Journal of Advanced Manufacturing Technology
Volumn 27, Issue 1-2, 2005, Pages 174-180
Heuristic search algorithms for lot streaming in a two-machine flowshop
Author keywords

Flowshop; Genetic algorithm; Heuristic algorithm; Lot streaming; Scheduling
Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; PARAMETER ESTIMATION; PERTURBATION TECHNIQUES; PROBLEM SOLVING; SCHEDULING; SENSITIVITY ANALYSIS; SIMULATED ANNEALING;
EID: 27944479935     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-004-2127-2     Document Type: Article
Times cited : (11)
References (16)
  • 4
    • 84974861854 scopus 로고
    • Integrating scheduling with batching and lot-sizing
    • Potts CN, Wassenhove LN (1992) Integrating scheduling with batching and lot-sizing. J Oper Res Soc 43(5):395-406
    • (1992) J Oper Res Soc , vol.43 , Issue.5 , pp. 395-406
    • Potts, C.N.1    Wassenhove, L.N.2
  • 5
    • 0024925432 scopus 로고
    • Flowshop scheduling with lot streaming
    • Potts CN, Baker KR (1989) Flowshop scheduling with lot streaming. Oper Res Lett 8:297-303
    • (1989) Oper Res Lett , vol.8 , pp. 297-303
    • Potts, C.N.1    Baker, K.R.2
  • 6
    • 21844508729 scopus 로고
    • Lot streaming in the two-machine flow shop with setup times
    • Baker KR (1995) Lot streaming in the two-machine flow shop with setup times. Ann Oper Res 57:1-11
    • (1995) Ann Oper Res , vol.57 , pp. 1-11
    • Baker, K.R.1
  • 8
    • 0029378595 scopus 로고
    • Optimal lot streaming for multiple products in a two-machine flowshop
    • Vickson RG (1995) Optimal lot streaming for multiple products in a two-machine flowshop, Eur J Oper Res 85:556-575
    • (1995) Eur J Oper Res , vol.85 , pp. 556-575
    • Vickson, R.G.1
  • 9
    • 0033363409 scopus 로고    scopus 로고
    • Lot streaming and scheduling multiple products in two-machine no-wait flowshops
    • Sriskandarajah C, Wagneur E (1999) Lot streaming and scheduling multiple products in two-machine no-wait flowshops. IIE Trans 31:695-707
    • (1999) IIE Trans , vol.31 , pp. 695-707
    • Sriskandarajah, C.1    Wagneur, E.2
  • 10
    • 0033708147 scopus 로고    scopus 로고
    • Lot streaming and scheduling heuristics for m-machine no-wait flowshops
    • Kumar S, Bagchi TP, Sriskandarajah C (2000) Lot streaming and scheduling heuristics for m-machine no-wait flowshops. Comput Ind Eng 38:149-172
    • (2000) Comput Ind Eng , vol.38 , pp. 149-172
    • Kumar, S.1    Bagchi, T.P.2    Sriskandarajah, C.3
  • 11
    • 0001551888 scopus 로고
    • Sequencing n jobs on two machines with arbitrary time lags
    • Johnson SM (1959) Sequencing n jobs on two machines with arbitrary time lags. Manage Sci 5:293-303
    • (1959) Manage Sci , vol.5 , pp. 293-303
    • Johnson, S.M.1
  • 13
    • 0030241443 scopus 로고    scopus 로고
    • Genetic algorithms for flowshop scheduling problems
    • Murata T, Ishibuchi H, Tanaka H (1996) Genetic algorithms for flowshop scheduling problems. Comput Ind Eng 30(4)1061-1071
    • (1996) Comput Ind Eng , vol.30 , Issue.4 , pp. 1061-1071
    • Murata, T.1    Ishibuchi, H.2    Tanaka, H.3
  • 15
    • 0025263381 scopus 로고
    • The application of the simulated annealing algorithm to the solution of the n/m/C max flowshop problem
    • Ogbu FA, Smith DK (1990) The application of the simulated annealing algorithm to the solution of the n/m/C max flowshop problem. Comput Oper Res 17:243-253
    • (1990) Comput Oper Res , vol.17 , pp. 243-253
    • Ogbu, F.A.1    Smith, D.K.2
  • 16
    • 0031145735 scopus 로고    scopus 로고
    • An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup time of jobs
    • Parthasarathy S, Rajendran C (1997) An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup time of jobs. Int J Prod Econ 49:255-263
    • (1997) Int J Prod Econ , vol.49 , pp. 255-263
    • Parthasarathy, S.1    Rajendran, C.2

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