Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds

DOI10.1007/3-540-59408-6_60zbMath1500.90018OpenAlexW1500197053MaRDI QIDQ5101424

Maurice Queyranne, Andreas S. Schulz

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_60

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

A supermodular relaxation for scheduling with release dates ⋮ Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds ⋮ Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem ⋮ Stochastic Online Scheduling Revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized polymatroids and submodular flows
• Submodular functions and optimization
• On the convex hull of feasible solutions to certain combinatorial problems
• Structure of a simple scheduling polyhedron
• The permutahedron of \(N\)-sparse posets
• Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time
• On the facial structure of scheduling polyhedra
• Submodular systems and related topics
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Adjacent Vertices on a Permutohedron
• Scheduling independent tasks to reduce mean finishing time
• An Inequality

This page was built for publication: Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds