Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags

Autor:	Almathkour Fatmah, Belgacem Omar, Toumi Said, Jarboui Bassem
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	branch & bound algorithm total weighted tardiness time lags permutation flowshop scheduling problem Management information systems T58.6-58.62
Zdroj:	Yugoslav Journal of Operations Research, Vol 32, Iss 1, Pp 45-59 (2022)
Druh dokumentu:	article
ISSN:	0354-0243 1820-743X
DOI:	10.2298/YJOR210615023A
Popis:	This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm. A new lower bound was developed for the flowshop scheduling problem. The computational experiments indicate that the proposed algorithm provides good solution in terms of quality and time requirements.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/2015dd5c95a5400a80c72837897fb4f3 Zobrazit plný text záznamu View record in DOAJ