Serial-batching scheduling with two agents to minimize makespan and maximum cost

Cheng He (), Chunqi Xu and Hao Lin
Additional contact information
Cheng He: Henan University of Technology
Chunqi Xu: China University of Geosciences (Beijing)
Hao Lin: Henan University of Technology

Journal of Scheduling, 2020, vol. 23, issue 5, No 6, 609-617

Abstract: Abstract This paper considers three serial-batching scheduling problems with two agents to minimize the makespan of agent A and maximum cost (or maximum lateness) of agent B simultaneously. In these two-agent scheduling problems, jobs of different agents cannot be processed in a common batch, and the cost function of an agent depends only on its jobs. For each problem, we present a polynomial-time algorithm which can find all Pareto optimal solutions.

Keywords: Two-agent scheduling; Serial-batching; Makespan; Maximum cost; Maximum lateness (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-020-00656-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:23:y:2020:i:5:d:10.1007_s10951-020-00656-5

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-020-00656-5

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().