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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization Jg. 40; H. 3; S. 774 - 795
Hauptverfasser:	Geng, Zhichao, Liu, Jiayu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.10.2020 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!