Parallel branch-and-price algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times

Scheduling problems occur in a broad range of real-world application fields and have attracted a huge set of research articles. However, there is only little research on exact algorithms for scheduling problems, many of which are NP-hard in the strong sense. We investigate the problem on a single ma...

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & operations research Ročník 173; s. 106804
Hlavní autoři:	Speckenmeyer, Philipp, Hilmer, Constanze, Rauchecker, Gerhard, Schryen, Guido
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.01.2025
Témata:	Branch-and-price algorithm Dynamic programming Sequence-dependent setup times Shared-memory parallelization Single machine scheduling Weighted tardiness Branch-and-price algorithm Weighted tardiness Sequence-dependent setup times Dynamic programming Single machine scheduling Shared-memory parallelization
ISSN:	0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!