A note on a two-agent scheduling problem related to the total weighted late work

We revisit a two-agent scheduling problem in which a set of jobs belonging to two agents A and B (without common jobs) will be processed on a single machine for minimizing the total weighted late work of agent A subject to the maximum cost of agent B being bounded. Zhang and Wang (J Comb Optim 33:94...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 37; no. 3; pp. 989 - 999
Main Authors:	Zhang, Yuan, Yuan, Jinjiang
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2019 Springer Nature B.V
Subjects:	Algorithms Combinatorics Convex and Discrete Geometry Employment Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Production scheduling Scheduling Theory of Computation Two-agent Late work Scheduling Single machine
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!