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

DOI10.1007/3-540-59408-6_60MaRDI QIDQ5101424zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Scheduling identical jobs on uniform parallel machines
• A supermodular relaxation for scheduling with release dates
• Scheduling equal-length jobs on identical parallel machines
• Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
• scientific article; zbMATH DE number 3883931

Cites work

• Adjacent Vertices on a Permutohedron
• An Inequality
• Generalized polymatroids and submodular flows
• scientific article; zbMATH DE number 3904328 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 193993 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time
• On the convex hull of feasible solutions to certain combinatorial problems
• On the facial structure of scheduling polyhedra
• Scheduling independent tasks to reduce mean finishing time
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Structure of a simple scheduling polyhedron
• Submodular functions and optimization
• Submodular systems and related topics
• The permutahedron of \(N\)-sparse posets

Cited in

(7)

• Scheduling jobs with release dates on parallel batch processing machines
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
• Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines
• An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines
• A supermodular relaxation for scheduling with release dates
• Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
• Stochastic Online Scheduling Revisited

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

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