Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints

DOI10.1007/978-3-319-18167-7_28zbMath1370.90122OpenAlexW2296083055MaRDI QIDQ5357764

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

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18167-7_28

zbMATH Keywords

schedulinginterval constraintsgame-theoretical model

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

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

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Non-preemptive speed scaling
• 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
• Machine scheduling with availability constraints
• Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
• Speed-Scaling with No Preemptions
• Interval scheduling: A survey
• Resource Minimization Job Scheduling
• Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem

This page was built for publication: Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints