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

Saved in:
Bibliographic Details
Published inEuropean 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
LanguageEnglish
Published Elsevier B.V 01.02.2020
Subjects
Online AccessGet full text

Cover

Loading…