A size-reduction algorithm for the order scheduling problem with total tardiness minimization
| Autor: | Stephanie Alencar Braga-Santos, Giovanni Cordeiro Barroso, Bruno de Athayde Prata |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Journal of Project Management, Vol 7, Iss 3, Pp 167-176 (2022) |
| Druh dokumentu: | article |
| ISSN: | 2371-8366 2371-8374 |
| DOI: | 10.5267/j.jpm.2022.1.001 |
| Popis: | We investigated a variant of the customer order scheduling problem taking into consideration due dates to minimize the total tardiness. Since the problem under study is NP-hard, we propose an efficient size reduction algorithm (SR). We perform an extensive computational experience and compare our proposition with JPO-20 matheuristic, the best existing algorithm for the problem under study. We use the Relative Deviation Index (RDI) and the Success Rate (SRa) as the statistical indicators for the performance measure. We must emphasize that SR presented the lowest average RDI (around 15.5 %), whereas the JPO-20 presented an average RDI approximately three times higher (around 52.5 %). Furthermore, the proposed SR presented a higher average SRa (around 66.9%), whereas the JPO-20 presented a lower average success (around 25.7%). Our proposal used a lower computational effort, resulting in a reduction for the computation times of approximately 22%. The obtained results point to the superiority of the proposed SR in comparison with the JPO-20. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|