Dynamic parallel machine scheduling with deep Q-network
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 …
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 …
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
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 …
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 …
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
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 …
human activities resulting in the emission of greenhouse gases. This is caused by intensive …
Online flexible busy time scheduling on heterogeneous machines
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 …
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
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 …
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
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 …
deadlines, on identical parallel machines, to minimize the number of active machines is …
Balancing flow time and energy consumption
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 …
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 …
right-sizing the data center according to the currently arriving jobs. If there is a long period …