Zobrazit v EDS

A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions

Uloženo v:
Podrobná bibliografie
Název: A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
Autoři: Xiaofang Zhao, Shuguang Li
Zdroj: Electronic Research Archive, Vol 30, Iss 11, Pp 4209-4219 (2022)
Informace o vydavateli: American Institute of Mathematical Sciences (AIMS), 2022.
Rok vydání: 2022
Témata: T57-57.97, maximum delivery completion time, Applied mathematics. Quantitative methods, polynomial time approximation scheme, QA1-939, 0211 other engineering and technologies, scheduling, 0102 computer and information sciences, 02 engineering and technology, inclusive processing set restrictions, unbounded batch machines, 01 natural sciences, Mathematics
Popis: We consider the problem of scheduling jobs with delivery times and inclusive processing set restrictions on unbounded batch machines to minimize the maximum delivery completion time, which is equivalent to minimizing the maximum lateness from the optimization viewpoint. We develop a polynomial time approximation scheme for this strongly NP-hard problem that runs in linear time for any fixed accuracy requirement.
Druh dokumentu: Article
ISSN: 2688-1594
DOI: 10.3934/era.2022213
Přístupová URL adresa: https://doaj.org/article/f40906efd8224352bcd889b62717e2c2
Přístupové číslo: edsair.doi.dedup.....6b51ba94b209480088159b5604e66e18
Databáze: OpenAIRE
Popis
Abstrakt:We consider the problem of scheduling jobs with delivery times and inclusive processing set restrictions on unbounded batch machines to minimize the maximum delivery completion time, which is equivalent to minimizing the maximum lateness from the optimization viewpoint. We develop a polynomial time approximation scheme for this strongly NP-hard problem that runs in linear time for any fixed accuracy requirement.
ISSN:26881594
DOI:10.3934/era.2022213