Inverse interval scheduling via reduction on a single machine

DOI10.1016/j.ejor.2022.02.046OpenAlexW4214742300WikidataQ114184323 ScholiaQ114184323MaRDI QIDQ2158006

Yerim Chung, Sung-Pil Hong, Seho Yim, Myoung-Ju Park

Publication date: 22 July 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.02.046

zbMATH Keywords

schedulingstrong NP-hardnesspolynomial time approximation schemeinterval schedulinginverse optimization via reduction

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse chromatic number problems in interval and permutation graphs
• Non-preemptive speed scaling
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• An optimal greedy heuristic to color interval graphs
• Scheduling jobs with fixed start and end times
• Single machine scheduling subject to deadlines and resource dependent processing times
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Positive half-products and scheduling with controllable processing times
• On the approximability of an interval scheduling problem
• A survey of scheduling with controllable processing times
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
• Single machine scheduling with controllable release and processing parameters
• Interval scheduling on identical machines
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• Speed-Scaling with No Preemptions
• Interval scheduling: A survey
• An Optimal Solution for the Channel-Assignment Problem
• When Is the Classroom Assignment Problem Hard?
• Approximation Algorithms for Fixed Job Schedule Problems
• Minimal Resources for Fixed and Variable Job Schedules
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
• Scheduling to minimize the total compression and late costs
• Frequency planning and ramifications of coloring
• Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• A unified approach to approximating resource allocation and scheduling
• Theory and Applications of Models of Computation
• Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases

This page was built for publication: Inverse interval scheduling via reduction on a single machine