Bicriteria scheduling of equal length jobs on uniform parallel machines

We study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling with generated completion times (shortly, GCT-scheduling), we show that the scheduling of equal length jobs on uniform parallel machines can b...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 39; no. 3; pp. 637 - 661
Main Authors:	Zhao, Qiulan, Yuan, Jinjiang
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2020 Springer Nature B.V
Subjects:	Combinatorics Completion time Convex and Discrete Geometry Job shops Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Production scheduling Sarin Scheduling Theory of Computation Uniform parallel machines NP-hardness Generated completion times Bicriteria scheduling Polynomial time algorithm
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!