Multi-machine energy-aware scheduling
DOI10.1007/S13675-016-0072-0zbMATH Open1458.90360OpenAlexW2472620773MaRDI QIDQ2397770FDOQ2397770
Authors: David Van Den Dooren, Thomas Sys, Túlio A. M. Toffolo, T. Wauters, Greet Vanden Berghe 
Publication date: 23 May 2017
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-016-0072-0
Recommendations
- Efficient approaches for solving a multiobjective energy-aware job shop scheduling problem
- A multi-criteria MILP formulation for energy aware hybrid flow shop scheduling
- Power of pre-processing: production scheduling with variable energy pricing and power-saving states
- A bi-objective heuristic approach for green identical parallel machine scheduling
- Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- MIP-and-refine matheuristic for smart grid energy management
- Metaheuristics. From design to implementation.
- Operational methods for minimization of energy consumption of manufacturing equipment
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Record breaking optimization results using the ruin and recreate principle
- Scheduling subject to resource constraints: Classification and complexity
- The late acceptance hill-climbing heuristic
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited In (10)
- Power of pre-processing: production scheduling with variable energy pricing and power-saving states
- A near optimal mechanism for energy aware scheduling
- A polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnace
- A bi-objective heuristic approach for green identical parallel machine scheduling
- A multi-criteria MILP formulation for energy aware hybrid flow shop scheduling
- Energy-oriented scheduling based on evolutionary algorithms
- Sequential predictive scheduling in partitioned data domains
- Job shop scheduling with flexible energy prices and time windows
- Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
- Efficient approaches for solving a multiobjective energy-aware job shop scheduling problem
This page was built for publication: Multi-machine energy-aware scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397770)
