The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm

DOI10.1016/j.dam.2009.02.012zbMath1185.90068MaRDI QIDQ967432

Jacques Carlier, Aziz Moukrim, Huang Xu

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.02.012

zbMATH Keywords

list scheduling; polynomial algorithms; linear order; project scheduling problem

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Related Items

Complexity of single machine scheduling subject to nonnegative inventory constraints, Lower bounds for the event scheduling problem with consumption and production of resources

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of scheduling unit-time jobs with or-precedence constraints
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• A fast feasibility test for relocation problems
• Heuristics for scheduling with inventory: Dynamic focus via constraint criticality
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
• Scheduling of continuous and discontinuous material flows with intermediate storage restrictions
• Continuous filling and emptying of storage systems in constraint-based scheduling
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Project scheduling with inventory constraints
• Optimal two- and three-stage production schedules with setup times included
• The Recognition of Series Parallel Digraphs
• Complete Register Allocation Problems
• Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints
• Depth-First Search and Linear Graph Algorithms
• A constraint-based method for project scheduling with time windows