Use MIP to Solve The Problem Of Parallel Batch Machine Scheduling with Machine Eligibility and Waiting Time Constraints
| Autor: | Ying-Shan Chen, 陳瑩珊 |
|---|---|
| Rok vydání: | 2019 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 107 In this research, we research the scheduling problem with n lots that can be divided into batches and m parallel machines under availability constraint. Due to the eligibility constraint, each lots has its own recipe, not all m machines can process the all recipes. And the lots have the waiting time before the processing, they can process together when their arrival time smaller than the batch’s waiting time. Therefore, the goal of our research is to find the minimum completion time for the last system to leave the system, subject to these constraints. In order to find the optimal solution to this problem, this study proposes a model for mixed integer programming. And with time constraints, machine eligibility constraint, batch processing constraint, and parallel machine processing constraint. In our environment settings. The assumptions we put forward are more similar to the actual environment of the semiconductor industry. Finally, we use mixed integer programming to solve this scheduling problem. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|