Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times

Taşgetiren, M. Fatih; Öztop, Hande; Eliiyi, Uğur; Eliiyi, Deniz Türsel; Pan, Quan-Ke

doi:10.1007/978-3-319-95930-6_76

Cited by 9 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Among the studies which consider the speed factor, [16] and [17] studied the complexity of a deadline-based scheduling problem under a variable processing speed for the preemptive and non-preemptive cases, intending to find a feasible schedule that minimizes the energy consumption. [18] examined the trade-off between total energy consumption and total weighted tardiness in a single machine environment with sequence-dependent setup times, where different jobs can be operated at varying speed levels.…”

Section: Energy Consumptionmentioning

confidence: 99%

Energy-efficient scheduling problem under speed-scaling and power-saving machine state

Aghelinejad

Ouazène

Yalaoui

2022

Preprint

View full text Add to dashboard Cite

This paper addresses the problem of scheduling different non-preemptive jobs on a single machine under time of use electricity tariffs consideration. The considered machine has three main states (OFF, ON, Idle) and two transition states (Turn-on and Turn-off). Each of these machine’s states as well as the processing jobs, consume a specific amount of energy. Moreover, a speed-scalable case of the problem is considered, in which jobs can be processed at an arbitrary speed with a trade-off between speed and energy consumption. First, a mixed-integer linear programming model with the objective of minimizing total energy consumption costs formulates this scheduling problem. Then, since this problem is strongly NP-hard, different approximate optimization methods are investigated to provide near-optimal solutions. Finally, an extensive computational study is carried out to establish the efficiency of the proposed algorithms. The obtained results show, how a well-tuned genetic algorithm combined with an adequate local search procedure constitutes an efficient method for solving this energy-aware scheduling problem.

show abstract

Section: Energy Consumptionmentioning

confidence: 99%

Energy-efficient scheduling problem under speed-scaling and power-saving machine state

Aghelinejad

Ouazène

Yalaoui

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…[31], tek makina çizelgeleme probleminde hız ayarlama stratejisini dikkate almışlardır. Yapılan çalışmada [31] numaralı çalışmaya göre incelenen problem ve çözüm yöntemi farklıdır. İlgili çalışmada amaç fonksiyonu toplam enerji tüketimi ve toplam ağırlıklı gecikmenin enküçüklenmesidir.…”

Section: Gi̇ri̇ş (Introduction)unclassified

“…Ayrıca yapılan çalışmada problemin çözümünde farklı bir sezgisel algoritma önerilip, önerilen algoritmanın başarısı literatürdeki NSGA II (Non-dominated Sorting Genetic Algorithm II ) algoritmasıyla karşılaştırılmıştır. [31] numaralı çalışmada en çok 60 iş için sezgisel algoritma çalıştırılmıştır. Yapılan çalışmada ise problem boyutu daha büyük alınmıştır.…”

Section: Gi̇ri̇ş (Introduction)unclassified

Enerji etkin ve sıra bağımlı hazırlık süreli tek makine çizelgeleme problemi için tavlama benzetimi algoritması tabanlı hibrit sezgisel çözüm önerisi

Bektur

2020

Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi

View full text Add to dashboard Cite

 Energy efficient single machine scheduling problem  Multi-objective heuristic algorithm  Sequence dependent setup times In this study, energy efficient single machine scheduling problem with sequence dependent setup times is considered. Speed scaling mechanism is taken in to account. Objective functions of the problem are minimization of the total number of tardy jobs and total energy consumption. A multi-objective heuristic algorithm is proposed for the problem. The proposed heuristic algorithm is compared with NSGA II and εconstraint method. The Pareto front obtained by NSGA II and proposed heuristic algorithm is given in Figure A. The proposed heuristic algorithm outperforms NSGA II significantly.

show abstract

A Variable Block Insertion Heuristic for the Energy-Efficient Permutation Flowshop Scheduling with Makespan Criterion

Taşgetiren

Öztop

Pan

et al. 2020

Heuristics for Optimization and Learning

View full text Add to dashboard Cite

Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times

Cited by 9 publications

References 19 publications

Energy-efficient scheduling problem under speed-scaling and power-saving machine state

Energy-efficient scheduling problem under speed-scaling and power-saving machine state

Enerji etkin ve sıra bağımlı hazırlık süreli tek makine çizelgeleme problemi için tavlama benzetimi algoritması tabanlı hibrit sezgisel çözüm önerisi

A Variable Block Insertion Heuristic for the Energy-Efficient Permutation Flowshop Scheduling with Makespan Criterion

Contact Info

Product

Resources

About