Results 121 to 130 of about 14,397 (225)

Envy-Free Makespan Approximation

We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we put forward an envy-free poly-time mechanism that approximates the minimal makespan to within a factor ...
Amos Fiat, Haim Kaplan, Edith Cohen, Michal Feldman, Svetlana Olonetsky   +4 more
core  

Minimizing Makespan in a Pallet-Constrained Flowshop

, 2000
We consider the problem of scheduling n jobs in a pallet-constrained two-machine flowshop so as to minimize the makespan. In such a owshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of
Chelliah Sriskandarajah, M. Y. Wang, Han Hoogeveen, Steef Van De Velde, Suresh P. Sethi   +4 more
core  

Online Parallel Paging with Optimal Makespan

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2022
Agrawal K., Bender M. A., Das R., Kuszmaul W., Peserico E., Scquizzato M.   +5 more
openaire   +3 more sources

Stochastically minimizing makespan on a three-machine flowshop

, 2004
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   +1 more source

Balancing safety and efficiency in large-scale HRC: A dynamic scheduling method confronting temporal and spatial uncertainty of human workers. [PDF]

iScience
Xia H, Sun Z, Tong H.
europepmc   +1 more source

Accessibility-aware multi-objective truck-drone hybrid routing for post-disaster humanitarian logistics. [PDF]

Sci Rep
Kocataş BD, Ercan Cömert S.
europepmc   +1 more source

Hybrid Bacterial Colony Optimization and Particle Swarm Optimization for load balancing in fog computing. [PDF]

PLoS One
Kumar A, Gupta P, Verma R.
europepmc   +1 more source

An analysis tableau and algorithm for flow-shop makespan minimization

, 1983
An analysis tableau suitable for investigating flow-shop attributes is presented in detail 1. Geometric properties, inherent within the tableau, are employed using graph theory concepts in developing a heuristic algorithm for makespan minimization ...
McHale, Nancy Ellis
core  

Hybrid GA-DQL approach for efficient task mapping of IoT applications in fog computing framework. [PDF]

Sci Rep
Tripathy N, Sahoo S, Alghamdi NS, Dhiman G.   +3 more
europepmc   +1 more source

Federated multi-cloud task scheduling with load balancing using multi-objective NSGA-II and reinforcement learning. [PDF]

Sci Rep
Ghaban W, Alatawi HS.
europepmc   +1 more source