Stochastically minimizing makespan on a three-machine flowshop
Johnson considers the deterministic three-machine flowshop problem to minimize makespan. He shows that permutation schedules are dominant, and establishes an optimal algorithm for the cases where the minimum processing time on either machine 1 or machine
ALLAHVERDİ, ALİ
core
WS-SSA: workflow scheduling in cloud computing using salp swarm algorithm. [PDF]
Sharawy AA +3 more
europepmc +1 more source
Minimizing makespan on a single machine subject to random breakdowns
We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns.
Aytuğ, Haldun +2 more
core
Optimizing the Classic and the Energy-Efficient Permutation Flowshop Scheduling Problem with a Hybrid Tyrannosaurus Rex Optimization Algorithm. [PDF]
Tsiftsoglou M, Marinakis Y, Marinaki M.
europepmc +1 more source
Efficient workflow scheduling in fog-cloud collaboration using a hybrid IPSO-GWO algorithm. [PDF]
Awad S +3 more
europepmc +1 more source
A Scheduling Model for Maximizing Availability with Makespan Constraint Based on Residual Lifetime in Heterogeneous Clusters [PDF]
Xin Jiang, Chuang Lin, Hao Yin, Yada Hu
openalex +1 more source
Energy and makespan optimised task mapping in fog enabled IoT application: a hybrid approach. [PDF]
Tripathy N +4 more
europepmc +1 more source
Performance Guarantees of Local Search for Multiprocessor Scheduling
Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied ...
Vredeveld,Tjark, Schuurman,Petra
core
Hybrid Monarch Butterfly Optimization-DenseNet framework for energy-aware task scheduling in cloud environments. [PDF]
Manavalan T +4 more
europepmc +1 more source

