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

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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 40; no. 3; pp. 774 - 795
Main Authors:	Geng, Zhichao, Liu, Jiayu
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2020 Springer Nature B.V
Subjects:	Algorithms Combinatorics Completion time Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Pareto optimum Polynomials Schedules Scheduling Theory of Computation Splitable jobs Polynomial-time algorithm Parallel-batch Pareto optimal
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!