A size-reduction algorithm for the order scheduling problem with total tardiness minimization

• Autor(a) principal: Prata, Bruno de Athayde
• Data de Publicação: 2022
• Outros Autores: Barroso, Giovanni Cordeiro, Santos, Stéphanie Alencar Braga dos
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Institucional da Universidade Federal do Ceará (UFC)
• Texto Completo: http://www.repositorio.ufc.br/handle/riufc/68347
• topic: Production sequencing; Combinatorial optimization; Matheuristics; Mixed-Integer linear programming

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.