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

DOI10.1287/OPRE.26.1.141MaRDI QIDQ4152016zbMATH OpenOpenAlexFDO

Authors

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)

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152016)