### Abstract

We present a method to solve a scheduling problem with incompatible job families and unequal ready times of the jobs for a single batch processing machine. Problems of this type arise, for example, in the diffusion process in semiconductor manufacturing. We are interested in minimizing the performance measure total weighted tardiness (TWT). We extend the decision theory approach of Kanet and Zhou to the present situation. By introducing an appropriate time window, we first form a potential batch from the jobs that are ready within the time window. We then evaluate this decision by considering the TWT value of the remaining jobs. In order to calculate the TWT of these jobs we have to estimate the completion times of the jobs. We use a simple average completion time estimate and more sophisticated completion time estimate by a deterministic forward simulation using a variant of the Apparent Tardiness Cost Dispatching rule. We report on computational experiments based on generated test data.

Original language | English (US) |
---|---|

Title of host publication | IIE Annual Conference and Exhibition 2004 |

Pages | 1959-1964 |

Number of pages | 6 |

State | Published - 2004 |

Event | IIE Annual Conference and Exhibition 2004 - Houston, TX, United States Duration: May 15 2004 → May 19 2004 |

### Other

Other | IIE Annual Conference and Exhibition 2004 |
---|---|

Country | United States |

City | Houston, TX |

Period | 5/15/04 → 5/19/04 |

### Fingerprint

### Keywords

- Batching
- Decision Theory Approach
- Scheduling
- Semiconductor Manufacturing

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*IIE Annual Conference and Exhibition 2004*(pp. 1959-1964)

**A decision theory approach for scheduling jobs with unequal ready times and incompatible families on a single batch processing machine.** / Mönch, Lars; Schmidt, Jeannine; Balasubramanian, Hari; Fowler, John.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IIE Annual Conference and Exhibition 2004.*pp. 1959-1964, IIE Annual Conference and Exhibition 2004, Houston, TX, United States, 5/15/04.

}

TY - GEN

T1 - A decision theory approach for scheduling jobs with unequal ready times and incompatible families on a single batch processing machine

AU - Mönch, Lars

AU - Schmidt, Jeannine

AU - Balasubramanian, Hari

AU - Fowler, John

PY - 2004

Y1 - 2004

N2 - We present a method to solve a scheduling problem with incompatible job families and unequal ready times of the jobs for a single batch processing machine. Problems of this type arise, for example, in the diffusion process in semiconductor manufacturing. We are interested in minimizing the performance measure total weighted tardiness (TWT). We extend the decision theory approach of Kanet and Zhou to the present situation. By introducing an appropriate time window, we first form a potential batch from the jobs that are ready within the time window. We then evaluate this decision by considering the TWT value of the remaining jobs. In order to calculate the TWT of these jobs we have to estimate the completion times of the jobs. We use a simple average completion time estimate and more sophisticated completion time estimate by a deterministic forward simulation using a variant of the Apparent Tardiness Cost Dispatching rule. We report on computational experiments based on generated test data.

AB - We present a method to solve a scheduling problem with incompatible job families and unequal ready times of the jobs for a single batch processing machine. Problems of this type arise, for example, in the diffusion process in semiconductor manufacturing. We are interested in minimizing the performance measure total weighted tardiness (TWT). We extend the decision theory approach of Kanet and Zhou to the present situation. By introducing an appropriate time window, we first form a potential batch from the jobs that are ready within the time window. We then evaluate this decision by considering the TWT value of the remaining jobs. In order to calculate the TWT of these jobs we have to estimate the completion times of the jobs. We use a simple average completion time estimate and more sophisticated completion time estimate by a deterministic forward simulation using a variant of the Apparent Tardiness Cost Dispatching rule. We report on computational experiments based on generated test data.

KW - Batching

KW - Decision Theory Approach

KW - Scheduling

KW - Semiconductor Manufacturing

UR - http://www.scopus.com/inward/record.url?scp=30044452018&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=30044452018&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:30044452018

SP - 1959

EP - 1964

BT - IIE Annual Conference and Exhibition 2004

ER -