Results 11 to 20 of about 4,494 (215)
Envy-Free Makespan Approximation [PDF]
SIAM Journal on Computing, 2009 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
openalex +4 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 +5 more sources
Multiobjective Approach to Schedule DAG Tasks on Voltage Frequency Islands
IEEE Access, 2023 Scheduling a Directed Acyclic Graph (DAG) on voltage frequency islands involves dividing the available processing units into multiple islands with varying voltage and frequency levels and then mapping the tasks of the DAG to the islands while minimizing ...
Sanchit, Navjot Singh, Jagpreet Singh
doaj +1 more source
Online Makespan Minimization with Parallel Schedules [PDF]
Algorithmica, 2014 In online makespan minimization a sequence of jobs $ = J_1,..., J_n$ has to be scheduled on $m$ identical parallel machines so as to minimize the maximum completion time of any job. We investigate the problem with an essentially new model of resource augmentation.
Albers, Susanne, Hellwig, Matthias
openaire +4 more sources
Scheduling battery charging jobs with linearly decreasing power demands to minimize the total time [PDF]
Bulletin of the Polish Academy of Sciences: Technical Sciences, 2020 In this work we consider a problem from the field of power- and energy-aware scheduling, in which a set of batteries have to be charged in a minimum time.
R. Różycki, G. Waligóra, J. Węglarz
doaj +1 more source
Effective Scheduling of Multi-Load Automated Guided Vehicle in Spinning Mill: A Case Study
IEEE Access, 2023 In the Flexible Manufacturing System (FMS), where material processing is carried out in the form of tasks from one department to another, the use of Automated Guided Vehicles (AGVs) is significant.
Parkavi Krishnamoorthy +7 more
doaj +1 more source
Minimizing the Makespan in Flowshops with Flexible Operations
IFAC Proceedings Volumes, 2012 We consider a flowshop with m machines each of which perform a specific operation of the identical parts to be processed. Two specific adjacent machines among all machines are capable of performing an additional operation required by each part, which is named as the flexible operation.
Hatice Hande Demirtas, Hakan Gültekin
openalex +4 more sources
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 the last job to complete. The incentives of the selfish jobs may lead to poor performance.
Michal Feldman, Amos Fiat, Alan Roytman
openaire +3 more sources
Mendel, 2019 The independent task scheduling problem in distributed computing environments with makespan optimization as an objective is an NP-Hard problem. Consequently, an important number of approaches looking to approximate the optimal makespan in reasonable time
Abdelhamid Khiat, Abdelkamel Tari
doaj +1 more source
Makespan Trade-Offs for Visiting Triangle Edges [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We study a primitive vehicle routing-type problem in which a fleet of $n$unit speed robots start from a point within a non-obtuse triangle $\Delta$, where $n \in \{1,2,3\}$. The goal is to design robots' trajectories so as to visit all edges of the triangle with the smallest visitation time makespan.
Konstantinos Georgiou +2 more
openaire +5 more sources