Scheduling jobs to minimize total cost

DOI10.1016/0377-2217(94)90208-9zbMath0802.90058OpenAlexW2049311656MaRDI QIDQ1330553

V. Pereyra

Publication date: 12 December 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90208-9

zbMATH Keywords

polynomial algorithmsdeadlinesrelease timesdeterministic schedulingmaximum flow problemindependent jobsmin-cost flow problemparallel identical processorspreemptively scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (6)

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows ⋮ Complexity of source-sink monotone 2-parameter min cut ⋮ Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches ⋮ Network flow approaches to pre-emptive open-shop scheduling problems with time-windows ⋮ Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times ⋮ A fast bipartite network flow algorithm for selective assembly

Cites Work

• Unnamed Item
• Unnamed Item
• On a scheduling problem where a job can be executed only by a limited number of processors
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Sequencing with Earliness and Tardiness Penalties: A Review
• Scheduling transmissions in a network
• Fast Algorithms for Bipartite Network Flow
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms

This page was built for publication: Scheduling jobs to minimize total cost