Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints

DOI10.1016/j.apm.2019.05.007zbMath1481.90183OpenAlexW2945084360MaRDI QIDQ1985052

Jordi Pereira, Luis Osorio-Valenzuela, Franco Quezada, Oscar C. Vásquez

Publication date: 7 April 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2019.05.007

zbMATH Keywords

schedulingparallel machinesbranch-and-priceinterval and workload constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• ILOG SCHEDULE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact algorithms for single-machine scheduling with time windows and precedence constraints
• Procedures for the bin packing problem with precedence constraints
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• The robust set covering problem with interval data
• Non-preemptive speed scaling
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Improving fleet utilization for carriers by interval scheduling
• Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
• Scheduling with a minimum number of machines
• Minimizing the number of machines for scheduling jobs with equal processing times
• Minimizing the number of machines for minimum length schedules
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
• Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
• Speed-Scaling with No Preemptions
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Resource Minimization Job Scheduling
• Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints

This page was built for publication: Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints