Results 11 to 20 of about 14,397 (225)
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 +2 more sources
Proportionally Fair Makespan Approximation
Proceedings of the AAAI Conference on Artificial IntelligenceWe study fair mechanisms for the classic job scheduling problem on unrelated machines with the objective of minimizing the makespan. This problem is equivalent to minimizing the egalitarian social cost in the fair division of chores. The two prevalent fairness notions in the fair division literature are envy-freeness and proportionality. Prior work has
Michal Feldman +3 more
core +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 +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 +6 more sources
IEEE Access, 2021 This paper considers an unrelated parallel machine problem with job release times and maintenance activities, in which machines have to periodically undergo maintenance since the status of the machines will be deteriorated by job-induced dirt.
Jihong Pang, Ya-Chih Tsai, Fuh-Der Chou
doaj +1 more source
Solución del Problema de Flow Shop Flexible Aplicando el Algoritmo Genético de Chu- Beasley
Entre Ciencia e Ingeniería, 2013 El problema de secuenciación de tareas en sistemas de producción lineal Flow Shop ha sido un tema de gran importancia en la investigación de operaciones donde se busca establecer la programación óptima de trabajos en máquinas dentro de un proceso de ...
Ángela Patricia Jiménez Morales +2 more
doaj +1 more source
Cost and Time Economical Planning Algorithm for Scientific Workflows in Cloud Computing
Future Internet, 2021 A heterogeneous system can be portrayed as a variety of unlike resources that can be locally or geologically spread, which is exploited to implement data-intensive and computationally intensive applications.
Jabanjalin Hilda +1 more
doaj +1 more source
The power of reordering for online minimum makespan scheduling [PDF]
, 2014 In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machines.
Englert, Matthias +3 more
core +1 more source
Applied Sciences, 2023 With the advancement of technology and time, people have always sought to solve problems in the most efficient and quickest way possible. Since the introduction of the cloud computing environment along with many different sub-substructures such as task ...
Chirag Chandrashekar +4 more
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