Complex Job-Shop Scheduling with Batching in Semiconductor Manufacturing

Abstract : The integration of batching machines within a job-shop environment leads to a complex job-shop scheduling problem. Semiconductor manufacturing presumably represents one of the most prominent practical applications for such problems. We consider a flexible job-shop scheduling problem with p-batching, reentrant flows, sequence dependent setup times and release dates while considering different regular objective functions. The scheduling of parallel batching machines and variants of the job-shop scheduling problem are well-studied problems whereas their combination is rarely considered.Existing disjunctive graph approaches for this combined problem rely on dedicated nodes to explicitly represent batches. To facilitate modifications of the graph, our new modeling reduces this complexity by encoding batching decisions into edge weights. An important contribution is an original algorithm that takes batching decisions “on the fly” during graph traversals. This algorithm is complemented by an integrated move to resequence and reassign operations. This combination yields a rich neighborhood that we apply within a GRASP based metaheuristic approach.We extend this approach by taking further constraints into account that are important in the considered industrial application. In particular, we model internal resources of machines in detail and take maximum time lag constraints into account. Numerical results for benchmark instances of different problem types show the generality and applicability of our approach. The conciseness of our idea facilitates extensions towards further complex constraints needed in real-world applications.
Document type :
Theses
Complete list of metadatas

Cited literature [199 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01665198
Contributor : Abes Star <>
Submitted on : Friday, December 15, 2017 - 3:50:24 PM
Last modification on : Tuesday, October 23, 2018 - 2:36:10 PM

File

knopp-sebastian-diff.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01665198, version 1

Collections

Citation

Sebastian Knopp. Complex Job-Shop Scheduling with Batching in Semiconductor Manufacturing. Other. Université de Lyon, 2016. English. ⟨NNT : 2016LYSEM014⟩. ⟨tel-01665198⟩

Share

Metrics

Record views

715

Files downloads

1113