Minimizing Total Completion Time on Parallel Machines with Deadline Constraints

DOI10.1137/S0097539702406388zbMath1052.90034OpenAlexW1966475537MaRDI QIDQ4429690

Joseph Y.-T. Leung, Michael L. Pinedo

Publication date: 28 September 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702406388

zbMATH Keywords

polynomial-time algorithmpreemptive schedulingunrelated machinestotal completion timemaximum latenessparallel and identical machinesdeadline constraints

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Fast approximation algorithms for bi-criteria scheduling with machine assignment costs ⋮ Total completion time minimization on multiple machines subject to machine availability and makespan constraints ⋮ Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints ⋮ Parallel machine makespan minimization subject to machine availability and total completion time constraints ⋮ Scheduling on parallel machines to minimise maximum lateness for the customer order problem

This page was built for publication: Minimizing Total Completion Time on Parallel Machines with Deadline Constraints