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

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

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...

Full description

Bibliographic Details
Main Authors: Xiaofang Zhao, Shuguang Li
Format: Article
Language:English
Published: AIMS Press 2022-09-01
Series:Electronic Research Archive
Subjects:
scheduling
unbounded batch machines
inclusive processing set restrictions
maximum delivery completion time
polynomial time approximation scheme
Online Access:https://www.aimspress.com/article/doi/10.3934/era.2022213?viewType=HTML

Internet

https://www.aimspress.com/article/doi/10.3934/era.2022213?viewType=HTML

Similar Items