메뉴 건너뛰기




Volumn 22, Issue 9-10, 2003, Pages 662-668

A heuristic method for discrete lot streaming with variable sublots in a flow shop

Author keywords

Consistent sublots; Discrete lot streaming; Flow shop; Simulated annealing (SA); Variable sublots

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; ITERATIVE METHODS; POLYNOMIALS; PROBLEM SOLVING; SIMULATED ANNEALING;

EID: 0346243617     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-002-1516-7     Document Type: Article
Times cited : (31)

References (18)
  • 1
    • 0033895628 scopus 로고    scopus 로고
    • Scheduling with batching: A review
    • Potts CN, Kovalyov MY (2000) Scheduling with batching: a review. Europ J Oper Res 120:228-249
    • (2000) Europ J Oper Res , vol.120 , pp. 228-249
    • Potts, C.N.1    Kovalyov, M.Y.2
  • 2
    • 0032179462 scopus 로고    scopus 로고
    • Lot-sizing with start-up times
    • Vanderbeck F (1998) Lot-sizing with start-up times. Manage Sci 44:1409-1425
    • (1998) Manage Sci , vol.44 , pp. 1409-1425
    • Vanderbeck, F.1
  • 4
    • 0028769450 scopus 로고
    • Job-splitting heuristic for lot-size scheduling in multi-product production processes
    • El-Najdawi MK (1994) Job-splitting heuristic for lot-size scheduling in multi-product production processes. Europ J Oper Res 75:365-377
    • (1994) Europ J Oper Res , vol.75 , pp. 365-377
    • El-Najdawi, M.K.1
  • 5
    • 84985755271 scopus 로고
    • Optimal and heuristic models for lot splitting in a flow shop
    • Kropp DH, Smunt TL (1990) Optimal and heuristic models for lot splitting in a flow shop. Decis Sci 21:691-708
    • (1990) Decis Sci , vol.21 , pp. 691-708
    • Kropp, D.H.1    Smunt, T.L.2
  • 6
    • 0013289896 scopus 로고    scopus 로고
    • Approximation methods for discrete lot streaming in flow shops
    • Chen J, Steiner G (1997) Approximation methods for discrete lot streaming in flow shops. Oper Res Lett 21:139-145
    • (1997) Oper Res Lett , vol.21 , pp. 139-145
    • Chen, J.1    Steiner, G.2
  • 7
    • 0032190044 scopus 로고    scopus 로고
    • Optimal streaming of a single job in a two-stage flow shop
    • Sen A, Topaloglu E, Benli OS (1998) Optimal streaming of a single job in a two-stage flow shop. Europ J Oper Res 110:42-62
    • (1998) Europ J Oper Res , vol.110 , pp. 42-62
    • Sen, A.1    Topaloglu, E.2    Benli, O.S.3
  • 8
    • 0033702610 scopus 로고    scopus 로고
    • Evaluation of the potential benefits of lot streaming in flow-shop systems
    • Kalir AA, Sarin SC (2000) Evaluation of the potential benefits of lot streaming in flow-shop systems. Int J Prod Econ 66:131-142
    • (2000) Int J Prod Econ , vol.66 , pp. 131-142
    • Kalir, A.A.1    Sarin, S.C.2
  • 9
    • 0033708147 scopus 로고    scopus 로고
    • Lot streaming and scheduling heuristics for m-machine no wait flowshop
    • Kumar S, Bagchi TP, Sriskandarajah C (2000) Lot streaming and scheduling heuristics for m-machine no wait flowshop. Comput Industr Engin 38:149-172
    • (2000) Comput Industr Engin , vol.38 , pp. 149-172
    • Kumar, S.1    Bagchi, T.P.2    Sriskandarajah, C.3
  • 10
    • 0000611941 scopus 로고
    • Basic techniques for lot streaming
    • Trietsch D, Baker KR (1993) Basic techniques for lot streaming. Oper Res 41:1065-1076
    • (1993) Oper Res , vol.41 , pp. 1065-1076
    • Trietsch, D.1    Baker, K.R.2
  • 11
    • 0000994184 scopus 로고
    • A comparative study of lot streaming procedure
    • Baker KR, Jia D (1993) A comparative study of lot streaming procedure. OMEGA 21:561-566
    • (1993) OMEGA , vol.21 , pp. 561-566
    • Baker, K.R.1    Jia, D.2
  • 12
    • 0032131709 scopus 로고    scopus 로고
    • Structural properties of lot streaming in a flow shop
    • Glass CA, Potts CN (1998) Structural properties of lot streaming in a flow shop. Math Oper Res 23:624-639
    • (1998) Math Oper Res , vol.23 , pp. 624-639
    • Glass, C.A.1    Potts, C.N.2
  • 13
    • 0033130747 scopus 로고    scopus 로고
    • Optimization of neural networks: A comparative analysis of the genetic algorithm and simulated annealing
    • Randall SS, Dorsey RE, Johnson JD (1999) Optimization of neural networks: a comparative analysis of the genetic algorithm and simulated annealing. Europ J Oper Res 114:589-601
    • (1999) Europ J Oper Res , vol.114 , pp. 589-601
    • Randall, S.S.1    Dorsey, R.E.2    Johnson, J.D.3
  • 14
    • 0030571697 scopus 로고    scopus 로고
    • Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm
    • Shtub A, LeBlanc LJ, Cai Z (1996) Scheduling programs with repetitive projects: a comparison of a simulated annealing, a genetic and a pair-wise swap algorithm. Europ J Oper Res 88:124-138
    • (1996) Europ J Oper Res , vol.88 , pp. 124-138
    • Shtub, A.1    LeBlanc, L.J.2    Cai, Z.3
  • 15
    • 0033166838 scopus 로고    scopus 로고
    • A parameter set design procedure for the simulated annealing algorithm under the computational time constraint
    • Wang TY, Wu KB (1999) A parameter set design procedure for the simulated annealing algorithm under the computational time constraint. Comput Oper Res 26:665-678
    • (1999) Comput Oper Res , vol.26 , pp. 665-678
    • Wang, T.Y.1    Wu, K.B.2
  • 16
    • 0344614423 scopus 로고    scopus 로고
    • Fuzzy rule base learning through simulated annealing
    • Guely F, La R, Siarry P (1999) Fuzzy rule base learning through simulated annealing. Fuzz Set Sys 105:353-363
    • (1999) Fuzz Set Sys , vol.105 , pp. 353-363
    • Guely, F.1    La, R.2    Siarry, P.3
  • 17
    • 0031186470 scopus 로고    scopus 로고
    • Lot streaming in job-shop scheduling
    • Dauzere-Peres S, Lasserre JB (1997) Lot streaming in job-shop scheduling Oper Res 45:584-595
    • (1997) Oper Res , vol.45 , pp. 584-595
    • Dauzere-Peres, S.1    Lasserre, J.B.2
  • 18
    • 0033297212 scopus 로고    scopus 로고
    • Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flowtime and weighted tardiness of jobs
    • Rajendran C, Ziegler H (1999) Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flowtime and weighted tardiness of jobs. Comput Industr Engin 37:671-690
    • (1999) Comput Industr Engin , vol.37 , pp. 671-690
    • Rajendran, C.1    Ziegler, H.2


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