1226. Solving Flexible Flow Shop Scheduling Problems with Parallel Batching and Maximal Time Lags
Invited abstract in session TA-12: Scheduling Approaches for Complex Manufacturing Systems, stream Scheduling and Project Management.
Tuesday, 8:30-10:00Room: Clarendon SR 1.02
Authors (first author is the speaker)
| 1. | Jens Rocholl
|
| University of Hagen | |
| 2. | Lars Moench
|
| FernUniversität in Hagen |
Abstract
Maximal time lags between consecutive process steps are important process restrictions in semiconductor manufacturing. A scheduling problem for a flexible flow shop with parallel batching, time lags, and the objective to minimize total weighted tardiness is considered. Jobs refer to different products, and only jobs of the same product may be grouped together in a batch. A constructive heuristic computing a schedule by successively inserting operations and making batching decisions on the fly while avoiding time lag violations is presented. The heuristic is integrated into a biased random key genetic algorithm. In addition, a decomposition approach is presented where subsets of jobs are iteratively assigned to batches and machines according to solutions to a mixed integer linear programming formulation. The performance of the procedures is assessed by means of computational experiments with randomly generated problem instances. The metaheuristic outperforms the decomposition approach.
Keywords
- Scheduling
- Metaheuristics
- Programming, Mixed-Integer
Status: accepted
Back to the list of papers