Scheduling parallel batch processors with incompatible job families to minimise weighted completion time

International Journal of Industrial and Systems Engineering

Volumn 4, Issue 1, 2009, Pages 76-93

  Venkataramana, Miryala ^a   Raghavan, N R Srinivasa ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b GM R and D and Strategic Planning   (India)

Author keywords

Batch processors; Incompatibility of job families; MINLP; Scheduling; Total weighted completion time

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING; NONLINEAR PROGRAMMING; PARALLEL PROCESSING SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS; SEMICONDUCTOR DEVICE MANUFACTURE;

BATCH PROCESSORS; DECOMPOSITION APPROACH; INCOMPATIBILITY OF JOB FAMILIES; INCOMPATIBLE JOB FAMILIES; MINLP; SEMICONDUCTOR MANUFACTURING; TOTAL WEIGHTED COMPLETION TIME; WEIGHTED COMPLETION TIME;

JOB SHOP SCHEDULING;

EID: 57349124886     PISSN: 17485037     EISSN: 17485045     Source Type: Journal    
DOI: 10.1504/IJISE.2009.021689     Document Type: Article

References (19)

1. Azizoglu, M. and Webster, S. (2000) 'Scheduling a batch processing machine non-identical job sizes', International Journal of Production Research, Vol. 38, No. 10, pp.2173-2184.
2. Azizoglu, M. and Webster, S. (2001) 'Scheduling a batch processing machine with incompatible job families', Computers and Industrial Engineering, Vol. 39, No. 3, pp.325-335.
3. Bussieck, M.R. and Pruessner, A. (2003) Mixed-Integer Nonlinear Programming, GAMS Development Corporation, Washington DC.
4. Chandru, V., Lee, C.Y. and Uzsoy, R. (1993) 'Minimizing total completion time on batch processing machines', International Journal of Production Research, Vol. 31, No. 9, pp.2097-2121.
5. Conway, R.W., Maxwell, W.L. and Miller, L.W. (1967) Theory of Scheduling, Addison-Wesley, New York.
6. Cooper, L. and Cooper, M.W. (1981) Introduction to Dynamic Programming, Pergamon Press, New York.
7. Dobson, G. and Nambimadom, R.S. (2001) 'The batch loading and scheduling problem', Operations Research, Vol. 49, No. 1, pp.52-65.
8. Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability -A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA.
9. Kawaguchi,T. and Kyan, S. (1986) 'Worst case bound of an LRF schedule for the mean weighted flow-time problem', SIAM Journal on Computing Vol. 14, No. 4, pp.1119-1129.
10. Koh, S.G., Koo, P.H., Kim, D.C. and Hur, W.S. (2005) 'Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families', International Journal of Production Economics, Vol. 98, No. 1, pp.81-96.
11. Mathirajan, M. and Sivakumar, A.I. (2006) 'A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor', International Journal of Advanced Manufacturing Technology, Vol. 29, Nos. 9-10, pp.990-1001.
12. Pineo, M. (1995) Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, New Jersy.
13. Potts, C.N. and Kovalyov, M.Y. (2000) 'Scheduling with batching: A review', European Journal of Operational Research, Vol. 120, No. 2, pp.228-249.
14. Potts, C.N. and van Wassenhove, L.N. (1985) 'A branch and bound algorithm for the total weighted tardiness problem', Operations Research, Vol. 33, No. 2, pp.363-377.
15. Taha, H.A. (1975) Integer Programming - Theory, Applications, and Computations, Academic Press, Reading, MA.
16. Uzosy, R. (1995) 'Scheduling batch processing machines with incompatible job families', International Journal of Production Research, Vol. 33, No. 10, pp.2685-2708.
17. Uzsoy, R. and Yang, Y. (1997) 'Minimizing total weighted completion time on a single batch processing machine', Production and Operations Management, Vol. 6, No. 1, pp.57-73.
18. Uzsoy, R., Lee, C-Y. and Martin-Vega, L.A. (1994) 'A review of production planning and scheduling models in the semiconductor industry - PART II: Shop-floor control', IIE Transactions, Vol. 26, No. 5, pp.44-55.
19. Webster, S. and Baker, K.R. (1995) 'Scheduling groups of jobs on a single machine', Operations Research, Vol. 43, No. 4, pp.692-703.