메뉴 건너뛰기




Volumn 98, Issue 1, 2005, Pages 81-96

Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families

Author keywords

Batch processing; Heuristic; Hybrid genetic algorithm; Integer programming; Scheduling

Indexed keywords

CAPACITORS; CERAMIC MATERIALS; GENETIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; JOB ANALYSIS;

EID: 23144434510     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2004.10.001     Document Type: Article
Times cited : (96)

References (29)
  • 1
    • 0001507294 scopus 로고
    • Batching and scheduling jobs on batch and discrete processors
    • J.H. Ahmadi, R.H. Ahmadi, S. Dasu, and C.S. Tang Batching and scheduling jobs on batch and discrete processors Operations Research 40 1992 750 763
    • (1992) Operations Research , vol.40 , pp. 750-763
    • Ahmadi, J.H.1    Ahmadi, R.H.2    Dasu, S.3    Tang, C.S.4
  • 4
    • 0031094753 scopus 로고    scopus 로고
    • Managing batch processors to reduce lead time in a semiconductor packaging line
    • P. Chandra, and S. Gupta Managing batch processors to reduce lead time in a semiconductor packaging line International Journal of Production Research 35 1997 611 633
    • (1997) International Journal of Production Research , vol.35 , pp. 611-633
    • Chandra, P.1    Gupta, S.2
  • 6
    • 0027560273 scopus 로고
    • Minimizing total completion time on a batch processing machine with job families
    • V. Chandru, C.Y. Lee, and R. Uzsoy Minimizing total completion time on a batch processing machine with job families Operations Research Letters 13 1993 61 65
    • (1993) Operations Research Letters , vol.13 , pp. 61-65
    • Chandru, V.1    Lee, C.Y.2    Uzsoy, R.3
  • 9
    • 0035000239 scopus 로고    scopus 로고
    • The batch loading and scheduling problem
    • G. Dobson, and R.S. Nambimadom The batch loading and scheduling problem Operations Research 49 2001 52 65
    • (2001) Operations Research , vol.49 , pp. 52-65
    • Dobson, G.1    Nambimadom, R.S.2
  • 10
    • 0031514083 scopus 로고    scopus 로고
    • Stochastic scheduling of a batch processing machine with incompatible job families
    • I. Duenyas, and J.J. Neale Stochastic scheduling of a batch processing machine with incompatible job families Annals of Operations Research 70 1997 191 220
    • (1997) Annals of Operations Research , vol.70 , pp. 191-220
    • Duenyas, I.1    Neale, J.J.2
  • 11
    • 84952175124 scopus 로고
    • Control of multiproduct bulk service diffusion/oxidation processes
    • J.W. Fowler, G.L. Hogg, and D.T. Phillips Control of multiproduct bulk service diffusion/oxidation processes IIE Transactions 24 1992 84 96
    • (1992) IIE Transactions , vol.24 , pp. 84-96
    • Fowler, J.W.1    Hogg, G.L.2    Phillips, D.T.3
  • 12
    • 0034135518 scopus 로고    scopus 로고
    • Control of multiproduct bulk server diffusion/oxidation processes. Part 2: Multiple servers
    • J.W. Fowler, G.L. Hogg, and D.T. Phillips Control of multiproduct bulk server diffusion/oxidation processes. Part 2 multiple servers IIE Transactions 32 2000 167 176
    • (2000) IIE Transactions , vol.32 , pp. 167-176
    • Fowler, J.W.1    Hogg, G.L.2    Phillips, D.T.3
  • 18
    • 0031270468 scopus 로고    scopus 로고
    • Scheduling semiconductor burn-in operations to minimize total flowtime
    • D.S. Hochbaum, and D. Landy Scheduling semiconductor burn-in operations to minimize total flowtime Operations Research 45 1997 874 885
    • (1997) Operations Research , vol.45 , pp. 874-885
    • Hochbaum, D.S.1    Landy, D.2
  • 19
    • 38149058172 scopus 로고
    • Scheduling algorithms for a single batch processing machine
    • Y. Ikura, and M. Gimple Scheduling algorithms for a single batch processing machine Operations Research Letters 5 1986 61 65
    • (1986) Operations Research Letters , vol.5 , pp. 61-65
    • Ikura, Y.1    Gimple, M.2
  • 21
    • 0031699840 scopus 로고    scopus 로고
    • Scheduling a single batch processing machine with secondary resource constraints
    • K.G. Kempf, R. Uzsoy, and C.S. Wang Scheduling a single batch processing machine with secondary resource constraints Journal of Manufacturing Systems 17 1998 37 51
    • (1998) Journal of Manufacturing Systems , vol.17 , pp. 37-51
    • Kempf, K.G.1    Uzsoy, R.2    Wang, C.S.3
  • 22
    • 0032804081 scopus 로고    scopus 로고
    • Minimizing makespan on a single batch processing machine with dynamic job arrivals
    • C.Y. Lee, and R. Uzsoy Minimizing makespan on a single batch processing machine with dynamic job arrivals International Journal of Production Research 37 1999 219 236
    • (1999) International Journal of Production Research , vol.37 , pp. 219-236
    • Lee, C.Y.1    Uzsoy, R.2
  • 23
    • 0026898494 scopus 로고
    • Efficient algorithms for scheduling semiconductor burn-in operations
    • C.Y. Lee, R. Uzsoy, and L.A. Martin-Vega Efficient algorithms for scheduling semiconductor burn-in operations Operations Research 40 1992 764 775
    • (1992) Operations Research , vol.40 , pp. 764-775
    • Lee, C.Y.1    Uzsoy, R.2    Martin-Vega, L.A.3
  • 24
    • 0032003105 scopus 로고    scopus 로고
    • Minimizing total tardiness on a batch processing machine with incompatible job families
    • S.V. Mehta, and R. Uzsoy Minimizing total tardiness on a batch processing machine with incompatible job families IIE Transactions 30 1998 165 178
    • (1998) IIE Transactions , vol.30 , pp. 165-178
    • Mehta, S.V.1    Uzsoy, R.2
  • 25
    • 0346148281 scopus 로고    scopus 로고
    • Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing
    • S. Melouk, P. Damodaran, and P.Y. Chang Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing International Journal of Production Economics 87 2004 141 147
    • (2004) International Journal of Production Economics , vol.87 , pp. 141-147
    • Melouk, S.1    Damodaran, P.2    Chang, P.Y.3
  • 27
    • 0028461472 scopus 로고
    • Scheduling a single batch processing machine with non-identical job sizes
    • R. Uzsoy Scheduling a single batch processing machine with non-identical job sizes International Journal of Production Research 32 1994 1615 1635
    • (1994) International Journal of Production Research , vol.32 , pp. 1615-1635
    • Uzsoy, R.1
  • 28
    • 0029387205 scopus 로고
    • Scheduling batch processing machines with incompatible job families
    • R. Uzsoy Scheduling batch processing machines with incompatible job families International Journal of Production Research 33 1995 2685 2708
    • (1995) International Journal of Production Research , vol.33 , pp. 2685-2708
    • Uzsoy, R.1
  • 29
    • 0036778940 scopus 로고    scopus 로고
    • A genetic algorithm to minimize maximum lateness on a batch processing machine
    • C.S. Wang, and R. Uzsoy A genetic algorithm to minimize maximum lateness on a batch processing machine Computers & Operations Research 29 2002 1621 1640
    • (2002) Computers & Operations Research , vol.29 , pp. 1621-1640
    • Wang, C.S.1    Uzsoy, R.2


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