Single machine batch scheduling with two non-disjoint agents and splitable jobs

Zhichao Geng () and Jiayu Liu
Additional contact information
Zhichao Geng: Zhengzhou University
Jiayu Liu: Henan College of Transportation

Journal of Combinatorial Optimization, No 0, 22 pages

Abstract: Abstract We investigate the scheduling problem on a single bounded parallel-batch machine where jobs belong to two non-disjoint agents (called agent A and agent B) and are of equal length but different size. Each job’s size can be arbitrarily split into two parts and processed in the consecutive batches. It is permitted to process the jobs from different agents in a common batch. We show that it is unary NP-hard for the problem of minimizing the total weighted completion time of the jobs of agent A subject to the maximum cost of the jobs of agent B being upper bounded by a given threshold. For the case of the jobs of agent A having identical weights, we study the version of Pareto problem, and give a polynomial-time algorithm to generate all Pareto optimal points and a Pareto optimal schedule corresponding to each Pareto optimal point.

Keywords: Parallel-batch; Splitable jobs; Pareto optimal; Polynomial-time algorithm (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00626-9 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:jcomop:v::y::i::d:10.1007_s10878-020-00626-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00626-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

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