energy efficient scheduling
Recently Published Documents


TOTAL DOCUMENTS

437
(FIVE YEARS 161)

H-INDEX

33
(FIVE YEARS 13)

2022 ◽  
Vol 18 (2) ◽  
pp. 1
Author(s):  
Seifedine Kadry ◽  
Karrar Hameed Abdulkareem ◽  
Abdullah Lakhan ◽  
Mazin Abed Mohammed ◽  
Ahmed N. Rashid

Energies ◽  
2021 ◽  
Vol 14 (21) ◽  
pp. 7446
Author(s):  
Adrian Kampa ◽  
Iwona Paprocka

The aim of this paper is to present a model of energy efficient scheduling for series production systems during operation, including setup and shutdown activities. The flow shop system together with setup, shutdown times and energy consumption are considered. Production tasks enter the system with exponentially distributed interarrival times and are carried out according to the times assumed as predefined. Tasks arriving from one waiting queue are handled in the order set by the Multi Objective Immune Algorithm. Tasks are stored in a finite-capacity buffer if machines are busy, or setup activities are being performed. Whenever a production system is idle, machines are stopped according to shutdown times in order to save energy. A machine requires setup time before executing the first batch of jobs after the idle time. Scientists agree that turning off an idle machine is a common measure that is appropriate for all types of workshops, but usually requires more steps, such as setup and shutdown. Literature analysis shows that there is a research gap regarding multi-objective algorithms, as minimizing energy consumption is not the only factor affecting the total manufacturing cost—there are other factors, such as late delivery cost or early delivery cost with additional storage cost, which make the optimization of the total cost of the production process more complicated. Another goal is to develop previous scheduling algorithms and research framework for energy efficient scheduling. The impact of the input data on the production system performance and energy consumption for series production is investigated in serial, parallel or serial–parallel flows. Parallel flow of upcoming tasks achieves minimum values of makespan criterion. Serial and serial–parallel flows of arriving tasks ensure minimum cost of energy consumption. Parallel flow of arriving tasks ensures minimum values of the costs of tardiness or premature execution. Parallel flow or serial–parallel flow of incoming tasks allows one to implement schedules with tasks that are not delayed.


Author(s):  
NARAYANA POTU ◽  
SREEDHAR BHUKYA ◽  
CHANDRASHEKAR JATOTH ◽  
PREMCHAND PARVATANENI

Sign in / Sign up

Export Citation Format

Share Document