AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home Electronic Research Archive Article
PDF (535.8 KB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

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

Xiaofang Zhao, Shuguang Li( )
College of Computer Science and Technology, Shandong Technology and Business University, Yantai 264005, China
Show Author Information

Abstract

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.

Keywords

schedulingunbounded batch machinesinclusive processing set restrictionsmaximum delivery completion timepolynomial time approximation scheme

References

【1】
【1】
 
 
Crossref Google Scholar
Electronic Research Archive
Volume 30 Issue 11,
November 2022
Pages 4209-4219
DOI: 10.3934/era.2022213

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Cite this Report
Close
Close
Cite this article:
Zhao X, Li S. A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions. Electronic Research Archive, 2022, 30(11): 4209-4219. https://doi.org/10.3934/era.2022213

8

Views

1

Downloads

0

Crossref

1

Web of Science

1

Scopus
Received: 20 May 2022
Revised: 15 September 2022
Accepted: 15 September 2022
Published: 15 November 2022
©2022 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)