Fixed interval scheduling with third‐party machines
From MaRDI portal
Publication:6065340
DOI10.1002/net.21973zbMath1528.90107OpenAlexW3047739098MaRDI QIDQ6065340
Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov, Ilia Fridman
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21973
subcontractingparallel machinesinterval graphsoutsourcingair traffic controlfixed interval scheduling
Cites Work
- Unnamed Item
- Optimal interval scheduling with a resource constraint
- Single machine scheduling problems with subcontracting options
- A survey on offline scheduling with rejection
- Scheduling with an outsourcing option on both manufacturer and subcontractors
- Interval scheduling on related machines
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Interval scheduling and colorful independent sets
- Decentralized subcontractor scheduling with divisible jobs
- Scheduling and fixed-parameter tractability
- On the \(k\)-coloring of intervals
- On the parameterized tractability of single machine scheduling with rejection
- Order acceptance and scheduling with machine availability constraints
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- An iterative graph expansion approach for the scheduling and routing of airplanes
- Scheduling with machine cost and rejection
- Production scheduling with subcontracting: the subcontractor's pricing game
- Interval scheduling on identical machines
- Interval scheduling: A survey
- An Optimal Solution for the Channel-Assignment Problem
- On Finding the Maxima of a Set of Vectors
- Techniques for scheduling with rejection
- Multiprocessor Scheduling with Rejection
- The Supplying Chain Scheduling with Outsourcing and Transportation
- “Rent-or-Buy” Scheduling and Cost Coloring Problems
- Parameterized Algorithms
- A general framework for handling commitment in online throughput maximization
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
