Results 11 to 20 of about 22,096 (146)
Makespan Minimization via Posted Prices [PDF]
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017 We consider job scheduling settings, with multiple machines, where jobs arrive online and choose a machine selfishly so as to minimize their cost. Our objective is the classic makespan minimization objective, which corresponds to the completion time of ...
Feldman, Michal +2 more
core +2 more sources
Online Makespan Minimization with Parallel Schedules [PDF]
Algorithmica, 2013 In online makespan minimization a sequence of jobs $\sigma = J_1,..., J_n$ has to be scheduled on $m$ identical parallel machines so as to minimize the maximum completion time of any job.
D.D. Sleator +22 more
core +3 more sources
Envy-Free Makespan Approximation [PDF]
SIAM Journal on Computing, 2012 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 of $O(\log m)$, where $m$ is the number of machines.
Edith Cohen +4 more
openaire +4 more sources
Stochastic makespan minimization in structured set systems [PDF]
Mathematical Programming, 2021 30 pages, 2 ...
Anupam Gupta +3 more
openaire +2 more sources
Makespan minimization with OR-precedence constraints [PDF]
Journal of Scheduling, 2021 AbstractWe consider a variant of the NP-hard problem of assigning jobs to machines to minimize the completion time of the last job. Usually, precedence constraints are given by a partial order on the set of jobs, and each job requires all its predecessors to be completed before it can start.
openaire +4 more sources
Envy-free makespan approximation [PDF]
Proceedings of the 11th ACM conference on Electronic commerce, 2010 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 of O(log m), where m is the number of machines.
Edith Cohen +4 more
openaire +1 more source
Scheduling over Scenarios on Two Machines [PDF]
, 2014 We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all possible scenarios.
A. Ben-Tal +10 more
core +3 more sources
Reduction of permutation flowshop problems to single machine problems using machine dominance relations [PDF]
, 2017 The Permutation Flowshop Scheduling Problem with Makespan objective (PFSP-M) is known to be NP-hard for more than two machines, and literally hundreds of works in the last decades have proposed exact and approximate algorithms to solve it. These works—of
Fernández-Viagas Escudero, Víctor +1 more
core +1 more source
Discrete parallel machine makespan ScheLoc problem [PDF]
Journal of Combinatorial Optimization, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hessler, Corinna, Deghdak, Kaouthar
openaire +4 more sources
Energy Efficient Scheduling via Partial Shutdown [PDF]
, 2009 Motivated by issues of saving energy in data centers we define a collection of new problems referred to as "machine activation" problems. The central framework we introduce considers a collection of $m$ machines (unrelated or related) with each machine ...
Kuller, Samir, Li, Jian, Saha, Barna
core +6 more sources