Preemptive scheduling with two minimax criteria

DOI10.1023/A:1014971620268zbMath1015.90044OpenAlexW77591251MaRDI QIDQ1599352

Francis Sourd

Publication date: 9 June 2002

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014971620268

zbMATH Keywords

single-machinepreemptive schedulingbicriterialength of a schedule

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Minimizing total completion time for preemptive scheduling with release dates and deadline constraints ⋮ Two-agent scheduling to minimize the maximum cost with position-dependent jobs ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions ⋮ Multicriteria scheduling ⋮ Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness

This page was built for publication: Preemptive scheduling with two minimax criteria