Application of df/ihs to minimum total weighted flow time multiprocessor scheduling problems

1988 ◽  
Vol 19 (6) ◽  
pp. 25-34 ◽  
Author(s):  
Hironori Kasahara ◽  
Munenori Kai ◽  
Seinosuke Narita ◽  
Hidehiko Wada
Keyword(s):  
Multiprocessor Scheduling ◽  
Flow Time ◽  
Scheduling Problems

scholarly journals Managing Energy Plus Performance in Data Centers and Battery-Based Devices Using an Online Non-Clairvoyant Speed-Bounded Multiprocessor Scheduling

2020 ◽  
Vol 10 (7) ◽  
pp. 2459 ◽  
Author(s):  
Pawan Singh ◽  
Baseem Khan ◽  
Om Prakash Mahela ◽  
Hassan Haes Alhelou ◽  
Ghassan Hayek
Keyword(s):  
Energy Management ◽  
Completion Time ◽  
Processing Time ◽  
Data Centers ◽  
Function Analysis ◽  
Multiprocessor Scheduling ◽  
Flow Time ◽  
Service Cost ◽  
Energy Plus ◽  
Time Required

An efficient scheduling reduces the time required to process the jobs, and energy management decreases the service cost as well as increases the lifetime of a battery. A balanced trade-off between the energy consumed and processing time gives an ideal objective for scheduling jobs in data centers and battery based devices. An online multiprocessor scheduling multiprocessor with bounded speed (MBS) is proposed in this paper. The objective of MBS is to minimize the importance-based flow time plus energy (IbFt+E), wherein the jobs arrive over time and the job’s sizes are known only at completion time. Every processor can execute at a different speed, to reduce the energy consumption. MBS is using the tradition power function and bounded speed model. The functioning of MBS is evaluated by utilizing potential function analysis against an offline adversary. For processors m ≥ 2, MBS is O(1)-competitive. The working of a set of jobs is simulated to compare MBS with the best known non-clairvoyant scheduling. The comparative analysis shows that the MBS outperforms other algorithms. The competitiveness of MBS is the least to date.

scholarly journals Pengembangan Algoritma Non Delay Pada Kasus Penjadwalan Non-Permutation Hybrid Flowshop Untuk Minimasi Mean Flowtime

2018 ◽  
Vol 19 (2) ◽  
pp. 148
Author(s):  
Siti Muhimatul Khoiroh
Keyword(s):  
Production Scheduling ◽  
Manufacturing Industry ◽  
Success Factors ◽  
Flow Shop ◽  
Flow Time ◽  
Hybrid Flow Shop ◽  
Scheduling Problems ◽  
Mean Flow ◽  
Mean Flow Time ◽  
Permutation Flow Shop

Production scheduling is one of the key success factors in the production process. Scheduling approach with Non-Permutation flow shop is a generalization of the traditional scheduling problems Permutation flow shop for the manufacturing industry to allow changing the job on different machines with the flexibility of combinations. This research tries to develop a heuristic approach that is non-delay algorithm by comparing Shortest Processing Time (SPT) and Largest Remaining Time (LRT) in the case of non-permutation flow shop to produce minimum mean flow time ratio. The result of simulation shows that the SPT algorithm gives less mean flow time value compared to LRT algorithm which means that SPT algorithm is better than LRT in case of non-permutation hybrid flow shop.

scholarly journals Energy-efficient multiprocessor scheduling for flow time and makespan

2014 ◽  
Vol 550 ◽  
pp. 1-20 ◽  
Author(s):  
Hongyang Sun ◽  
Yuxiong He ◽  
Wen-Jing Hsu ◽  
Rui Fan
Keyword(s):  
Energy Efficient ◽  
Multiprocessor Scheduling ◽  
Flow Time
Sign in / Sign up

Export Citation Format

Share Document