Scheduling a single semi-continuous batching machine

Omega

Volumn 36, Issue 6, 2008, Pages 992-1004

  Tang, Lixin ^a   Zhao, Yufang ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

Dynamic programming algorithm; Scheduling; Semi continuous batching machine

Indexed keywords

BATCH DATA PROCESSING; DYNAMIC PROGRAMMING; STEELMAKING;

BATCH-SCHEDULING; BATCHING MACHINE; CONTINUOUS BATCH; DYNAMIC PROGRAMMING ALGORITHM; FINISHING TIME; MACHINE SCHEDULING; SCHEDULING; SEMI-CONTINUOUS; SEMI-CONTINUOUS BATCHING MACHINE; STARTING TIME;

SCHEDULING ALGORITHMS;

EID: 40649116895     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2007.11.003     Document Type: Article

References (27)

1. Kalczynski P.J., and Kamburowski J. On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega 35 (2007) 53-60
2. Webster S., and Baker K.R. Scheduling groups of jobs on a singe machine. Operation Research 43 (1995) 692-703
3. Potts C.N., and Kovalyov M.Y. Scheduling with batching. European Journal of Operational Research 120 (2000) 228-249
4. Lee C.Y., Uzsoy R., and Martin-Vega L.A. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research 40 (1992) 764-775
5. Lee C.Y., and Uzsoy R. Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research 37 (1999) 219-236
6. Liu Z.H., and Yu W.C. Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics 105 (2000) 129-136
7. Brucker P., Gladky A., Hoogeveen H., Kovalyov M.Y., Potts C.N., Tautenhahn T., et al. Scheduling a batching machine. Journal of Scheduling 1 (1998) 31-54
8. Yuan J.J., Liu Z.H., Ng C.T., and Cheng T.C.E. The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theoretical Computer Science 320 (2004) 199-212
9. Sung C.S., Choung Y.I., Hong J.M., and Kim Y.H. Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals. Computers & Operation Research 29 (2002) 995-1007
10. Li S.G., Li G.J., Wang X.L., and Liu Q.M. Minimizing makespan on a single batching machine with release times and non-identical job sizes. Operations Research Letters 33 (2005) 157-164
11. Chandru V., Lee C.Y., and Uzoy R. Minimizing total completion time on batch processing machines. International Journal of Production Research 31 (1993) 2097-2121
12. Chandru V., Lee C.Y., and Uzoy R. Minimizing total completion time on a batch processing machines with job families. Operation Research Letters 13 (1993) 61-65
13. Hochbaum D.S., and Landy D. Scheduling semiconductor burn-in operations to minimize total flowtime. Operations Research 45 (1997) 874-885
14. Ikura Y., and Gimple M. Scheduling algorithms for a single batch processing machine. Operations Research Letters 5 (1986) 61-65
15. Ahmadi J.H., Ahmadi R.H., Dasu S., and Tang C.S. Batching and scheduling jobs on batch and discrete processors. Operations Research 39 (1992) 750-763
16. Cheng T.C.E., Yuan J.J., and Yang A.F. Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. Computers & Operation Research 32 (2005) 849-859
17. Lin B.M.T., Cheng T.C.E., and Chou A.S.C. Scheduling in an assembly-type production chain with batch transfer. Omega 35 (2007) 143-151
18. Coffman E.G., Yannakakis M., Magazine M.J., and Bantos C. Batch sizing and job sequencing on a single machine. Annals of Operations Research 26 (1990) 135-147
19. Cheng T.C.E., Chen Z.L., and Oguz C. One-machine batching and sequencing of multiple-type items. Computers and Operations Research 21 (1994) 717-721
20. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
21. Albers S., and Brucker P. The complexity of one-machine batching problems. Discrete Applied Mathematics 47 (1993) 87-107
22. Ng C.T., Cheng T.C.E., Yuan J.J., and Liu Z.H. On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, releasee dates and identical processing times. Operations Research Letters 31 (2003) 323-326
23. Tang L.X., Liu J.Y., Rong A.Y., and Yang Z.H. A review of planning and scheduling systems and methods for integrated steel production. European Journal of Operational Research 133 (2001) 1-20
24. Tang L.X., Liu J.Y., Rong A.Y., and Yang Z.H. A mathematical programming model for scheduling steelmaking-continuous casting production. European Journal of Operational Research 120 (2000) 423-435
25. Tang L.X., Luh P.B., Liu J.Y., and Fang L. Steel-making process scheduling using Lagrangian relaxation. International Journal of Production Research 40 (2002) 55-70
26. Sevastjanov P., and Figat P. Aggregation of aggregating modes in MCDM: synthesis of Type 2 and Level 2 fuzzy sets. Omega 35 (2007) 505-523
27. Lageweg BJ, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Computer aided complexity classification of deterministic scheduling problems. Research report BM138/81, Mathematics Centrum, Amsterdam, 1981.