Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints

DOI10.1287/OPRE.26.1.141zbMath0374.90034OpenAlexW2086037892MaRDI QIDQ4152016

No author found.

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1287/opre.26.1.141

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Detecting race conditions in parallel programs that use one semaphore ⋮ Scheduling UET-UCT series-parallel graphs on two processors ⋮ Structural properties and tractability results for linear synteny ⋮ Sequencing with general precedence constraints ⋮ Sequencing to minimize the maximum renewal cumulative cost ⋮ The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm ⋮ A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden ⋮ On strictly optimal schedules for the cumulative cost-optimal scheduling problem ⋮ Effective optimization methods for single-machine scheduling (survey)

This page was built for publication: Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints