Dynamic parallel machine scheduling with deep Q-network

CL Liu, CJ Tseng, TH Huang… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
Parallel machine scheduling (PMS) is a common setting in many manufacturing facilities, in
which each job is allowed to be processed on one of the machines of the same type. It …

A K-means-Teaching Learning based optimization algorithm for parallel machine scheduling problem

Y Li, J Liu, L Wang, J Liu, H Tang, J Guo, W Xu - Applied Soft Computing, 2024 - Elsevier
With the continuous increase of workshop production scale, traditional heuristic algorithms
in solving the scheduling problem have the defects of unsatisfactory computing time and …

Learning-augmented dynamic power management with multiple states via new ski rental bounds

A Antoniadis, C Coester, M Eliás… - Advances in neural …, 2021 - proceedings.neurips.cc
We study the online problem of minimizing power consumption in systems with multiple
power-saving states. During idle periods of unknown lengths, an algorithm has to choose …

Data-driven optimization for energy-constrained dietary supplement scheduling: A bounded cut MP-DQN approach

Y Zhao, S Ma, X Mo, X Xu - Computers & Industrial Engineering, 2024 - Elsevier
Energy rationing exerts a substantial influence on the landscape of manufacturing
operations. When mandatory energy rationing occurs, manufacturers find themselves …

[HTML][HTML] Green scheduling of identical parallel machines with release date, delivery time and no-idle machine constraints

L Hidri, A Alqahtani, A Gazdar, B Ben Youssef - Sustainability, 2021 - mdpi.com
Global warming and climate change are threatening life on earth. These changes are due to
human activities resulting in the emission of greenhouse gases. This is caused by intensive …

Online flexible busy time scheduling on heterogeneous machines

G Calinescu, S Davies, S Khuller, S Zhang - arxiv preprint arxiv …, 2024 - arxiv.org
We study the online busy time scheduling model on heterogeneous machines. In our setting,
unit-length jobs arrive online with a deadline that is known to the algorithm at the job's arrival …

Optimizing Dynamic Data Center Provisioning through Speed Scaling: A Primal-Dual Perspective

X Chen, H Xu, CZ Xu - Proceedings of the 36th ACM Symposium on …, 2024 - dl.acm.org
A significant proportion of energy consumed in modern data centers and clouds is dedicated
to provisioning idle servers for maintaining Quality of Service guarantees. Various studies …

No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines

N Brauner, MY Kovalyov, A Quilliot… - Computers & Operations …, 2021 - Elsevier
A problem of scheduling n unit-time jobs with a small number of distinct release dates and
deadlines, on identical parallel machines, to minimize the number of active machines is …

Balancing flow time and energy consumption

S Davies, S Khuller, S Zhang - … of the 34th ACM Symposium on …, 2022 - dl.acm.org
In this paper, we study the following batch scheduling model: find a schedule that minimizes
total flow time for n uniform length jobs, with release times and deadlines, where the …

Algorithms for energy conservation in heterogeneous data centers

S Albers, J Quedenfeld - Theoretical Computer Science, 2021 - Elsevier
Power consumption is the major cost factor in data centers. It can be reduced by dynamically
right-sizing the data center according to the currently arriving jobs. If there is a long period …