Lot scheduling on a single machine
| Autor: | Wen-Hung Kuo, Yung-Tsung Hou, Dar-Li Yang |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Mathematical optimization
Job shop scheduling Computer science Real-time computing Scheduling (production processes) Integrated circuit Economic lot scheduling problem Computer Science Applications Theoretical Computer Science law.invention law Signal Processing Lot number Completion time Time complexity Information Systems |
| Zdroj: | Information Processing Letters. 114:718-722 |
| ISSN: | 0020-0190 |
| DOI: | 10.1016/j.ipl.2014.06.016 |
| Popis: | In a practical situation, a manufacturer receives different orders from its customers. Different orders may contain different quantities of the product. Therefore, the manufacturer has to decide how to group these orders into different lots based on the capacity of the lot processing machine (such as integrated circuit tester, heated container, etc.) and then decides the sequence of these lots. In this paper, we study a lot scheduling problem with orders which can be split. The objective is to minimize the total completion time of all orders. We show that this problem can be solved in polynomial time. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect