Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes

International Journal of Production Research

Volumn 47, Issue 18, 2009, Pages 5109-5128

  Chung, S H ^a   Tai, Y T ^a   Pearn, W L ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Parallel batch; scheduling; unequal ready time

Indexed keywords

AGING TESTS; CAPACITY RESTRICTION; COMPOUND ALGORITHM; GENERALISATION; JOB SIZE; MAKESPAN; MILP MODEL; MIXED INTEGER LINEAR PROGRAMMING MODEL; PARALLEL BATCH; PARALLEL BATCH PROCESSING; PARALLEL BATCH SCHEDULING UNEQUAL READY TIME; PROCESSING TIME; REAL-WORLD APPLICATION; SCHEDULING PROBLEM; TFT-LCDS; THIN FILM TRANSISTOR LIQUID CRYSTAL DISPLAYS; TOTAL COMPLETION TIME; UNEQUAL READY TIME;

BATCH DATA PROCESSING; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LINEARIZATION; LIQUID CRYSTAL DISPLAYS; LIQUID CRYSTALS; MACHINERY; PARALLEL ALGORITHMS; PROCESSING; TESTING; THIN FILM TRANSISTORS;

SCHEDULING ALGORITHMS;

EID: 70449642707     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802010807     Document Type: Article

References (15)

1. Chang, P.Y., Damodaran, P., and Melouk, S., 2004. Minimising makespan on parallel batch processing machines. International Journal of Production Research, 42, 4211-4220.
2. Damodaran, P. and Srihari, K., 2004. Mixed integer formulation to minimise makespan in a flow shop with batch processing machines. Mathematical and Computer Modelling, 40, 1465-1472.
3. Erramilli, V. and Mason, S.J., 2006. Multiple orders per job compatible batch scheduling. IEEE Transactions on Electronics Packaging Manufacturing, 29 (4), 285-296.
4. Ikura, Y. and Gimple, M., 1986. Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters, 5, 61-65.
5. Kashan, A.H., Karimi, B., and Jolai, F., 2006. Effective hybrid genetic algorithm for minimising makespan on a single-batch-processing machine with non-identical job sizes. International Journal of Production Research, 44, 2337-2360.
6. Lee, C.Y. and Uzsoy, R., 1999. Minimising makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37 (1), 219-236.
7. Lee, C.Y., Uzsoy, R., and Martin-Vega, L.A., 1992. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40 (4), 764-775.
8. Mönch, L., et al., 2005. Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computer & Operations Research, 32, 2731-2750.
9. Morton, T.E. and Pentico, D.W., 1993. Heuristic scheduling systems: with applications to production systems and project management. New York: John Wiley & Sons.
10. Pearn, W.L., Chung, S.H., and Yang, M.H., 2002. Minimising the total machine workload for the wafer probing scheduling problem. IIE Transactions, 34, 211-220.
11. Sung, C.S. and Choung, Y.I., 2000. Minimising makespan on a single burn-in oven in semiconductor manufacturing. European Journal of Operational Research, 120, 559-574.
12. Sung, C.S., et al., 2002. Minimising makespan on a single burn-in oven with job families and dynamic job arrivals. Computer & Operations Research, 29, 995-1007.
13. Uzsoy, R., 1994. Scheduling of a single batch processing machines with non-identical job sizes. International Journal of Production Research, 32, 1615-1635.
14. Van Der Zee, D.J., 2004. Dynamic scheduling of batch servers with compatible product families. International Journal of Production Research, 42, 4803-4826.
15. Wolsey, L.A., 1998. Integer programming. 1st ed. New York: John Wiley & Sons.