An adaptive scheduling algorithm for a parallel machine problem with rework processes

International Journal of Production Research

Volumn 48, Issue 1, 2010, Pages 95-115

  Kang, Yong Ha ^a   Shin, Hyun Joon ^b  

^a North Carolina State University   (United States)

^b Sangmyung University   (South Korea)

Author keywords

Adaptive scheduling; Dispatching algorithm; Parallel machines; Problem space based search; Rework probability

Indexed keywords

ADAPTIVE SCHEDULING; DISPATCHING ALGORITHM; PARALLEL MACHINE; PROBLEM-SPACE-BASED SEARCH; SPACE-BASED;

ADAPTIVE ALGORITHMS; BENCHMARKING; COMPUTATIONAL EFFICIENCY; PROBABILITY;

SCHEDULING ALGORITHMS;

EID: 74549135706     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802484903     Document Type: Article

References (15)

1. Avic, S., Akturk, M.S., and Storer, R.H., 2003. A problem space algorithm for single machine weighted tardiness problems. HE Transactions, 35 (5), 479-186.
2. Flapper, S.D.P., et al., 2002. Planning and control of rework in the process industries: review. Production Planning & Control, 13 (1), 26-34.
3. Kim, C.O. and Shin, H.J., 2003. Scheduling jobs on parallel machines: a restricted tabu search approach. International Journal of Advanced Manufacturing Technology, 22 (3-4), 278-287.
4. Kuhl, M.E. and Laubisch, G.R., 2004. A simulation study of dispatching rules and rework strategies in semiconductor manufacturing. In: IEEE/SEMI advanced semiconductor manufacturing conference 4-6 May 2004, Boston, Massachusetts, USA, 325-329.
5. Kurz, M.E. and Askin, R.G., 2001. An adaptable problem-space based search method for flexible flow line scheduling. IIE Transactions, 33 (8), 691-693.
6. Lee, Y.H., Bhaskran, K., and Pinedo, M., 1997. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29 (1), 45-52.
7. Leon, V.J. and Ramamoorthy, B., 1995. Strength and adaptability of problem-space- based neighborhoods for resource-constrained scheduling. OR Spektrum, 17 (2), 173-182.
8. Leon, V.J. and Ramamoorthy, B., 1997. An adaptable problem-space based search method for flexible flow line scheduling. IIE Transactions, 29 (2), 115-125.
9. Ovacik, I.M. and Uzsoy, R., 1995. Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. International Journal of Production Research, 33 (11), 3173-3192.
10. Park, Y.S., Kim, S.Y., and Lee, Y.H., 2000. Scheduling jobs on parallel machines applying neural network and heuristic rules. Computers & Industrial Engineering, 38 (1), 189-202.
11. Ruiz, R., Maroto, C., and Alcaraz, J., 2005. Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165 (1), 34-54.
12. Sha, D.Y., et al., 2006. A dispatching rule for photolithography scheduling with an online rework strategy. Computers & Industrial Engineering, 50 (3), 233-247.
13. Shin, H.J., Kim, C.O., and Kim, S.S., 2002. A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times. International Journal of Advanced Manufacturing Technology, 19 (11), 859-866.
14. Storer, R.H., Wu, S.D., and Vaccari, R., 1992. New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38 (10), 1495-1509.
15. Turkcan, A. and Akturk, M.S., 2003. A problem space algorithm in multi-objective optimization. Journal of Intelligent Manufacturing, 14 (3-4), 363-378.