Variants of Multi-resource Scheduling Problems with Equal Processing Times
From MaRDI portal
Publication:3467836
DOI10.1007/978-3-319-26626-8_7zbMath1477.90018OpenAlexW2294069062MaRDI QIDQ3467836
Hamed Fahimi, Claude-Guy Quimper
Publication date: 5 February 2016
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_7
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding total unimodularity in optimization problems solved by linear programs
- Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
- Solving Project Scheduling Problems by Minimum Cut Computations
- Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Some simple scheduling algorithms
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- Scaling Algorithms for the Shortest Paths Problem
- The Geometry of Scheduling
This page was built for publication: Variants of Multi-resource Scheduling Problems with Equal Processing Times