Scheduling with release dates and preemption to minimize multiple max-form objective functions

•The scheduling objective function of each agent is regular and of max-form.•We study constrained (t1), weighted-sum (t2), Pareto (t3) scheduling problems.•(t1) is polynomial-time solvable; (t2) and (t3) are strongly NP-hard.•For fixed m and lateness-like criteria, (t2) and (t3) are polynomial-time...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 280; no. 3; pp. 860 - 875
Main Authors:	Yuan, Jinjiang, Ng, C.T., Cheng, T.C.E.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2020
Subjects:	Machine scheduling Multi-agent Multi-criteria Pareto scheduling Multi-agent Multi-criteria Machine scheduling Pareto scheduling
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!