Sequencing independent jobs with a single resource

DOI10.1002/NAV.3800270313zbMath0446.90043OpenAlexW2100347557MaRDI QIDQ3892058

Kenneth R. Baker, Henry L. W. Nuttle

Publication date: 1980

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800270313

zbMATH Keywords

single resourceminimization of job completion timessequencing independent jobsvariable resource availability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Scheduling on machines with variable service rates ⋮ NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time ⋮ Streaming algorithms for multitasking scheduling with shared processing ⋮ Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity ⋮ A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ One-machine job-scheduling with non-constant capacity -- minimizing weighted completion times

This page was built for publication: Sequencing independent jobs with a single resource