A single machine multi-job integer batch scheduling problem with multi due date to minimize total actual flow time
| Autor: | Yusriski, Rinto, Astuti, Budi, Biksono, Damawijaya, Wardani, Tika Ayu |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Decision Science Letters, Vol 10, Iss 3, Pp 231-240 (2021) |
| Druh dokumentu: | article |
| ISSN: | 1929-5804 1929-5812 |
| DOI: | 10.5267/j.dsl.2021.4.002 |
| Popis: | This research deals with a multi-job Integer batch scheduling problem on a single machine with different due dates. Every job demanded one or more parts, and the single machine processed the job into a number of batches. The objective is to minimize total actual flow time, defined as the total flow time of all jobs starting from the arrival to the common due date. The decisions are to determine the sequence of jobs, the number of batches, batch size, and sequence of all batches on a single machine. This research proposes three algorithms, developed based on the longest due date rule (The P1-LDD Algorithm), the adjacent pairwise interchange method (The P2-API Algorithm), and the permutation method (The P3-PM Algorithm). The numerical experience shows that the three algorithms produce an outstanding solution. The P1-LDD Algorithm fits to solve a simple problem. The P2-API Algorithm has superior to solve a big complicated problem. The P3-PM Algorithm has the best performance to solve small complicated problems. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|