Open AccessA linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
Author(s) -
Xiaofang Zhao,
Shuguang Li
Publication year - 2022
Publication title -
electronic research archive
Language(s) - English
Resource type - Journals
ISSN - 2688-1594
DOI - 10.3934/era.2022213
Subject(s) - scheduling (production processes) , mathematical optimization , time complexity , scheme (mathematics) , computer science , polynomial time approximation scheme , set (abstract data type) , job shop scheduling , due date , mathematics , distributed computing , algorithm , computer network , mathematical analysis , routing (electronic design automation) , queue , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom