Results 11 to 20 of about 13,809 (278)
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.
Ponitka, Tomasz +3 more
core +4 more sources
Envy-free makespan approximation [PDF]
Proceedings of the 11th ACM conference on Electronic commerce, 2010 We study envy-free mechanisms for assigning tasks to agents, where every task may take a different amount of time to perform by each agent, and the goal is to get all the tasks done as soon as possible (i.e., minimize the makespan). For indivisible tasks,
Amos Fiat +4 more
core +2 more sources
Journal of Engineering and Management in Industrial System, 2014 In the flow shop scheduling each job will go through every machine in the same order. The goal of this research is to complete a series of jobs in order to obtain the optimal makespan for stick skewers rounding machine.
Dian Setiya Widodo +2 more
doaj +3 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 +4 more sources
IEEE Access, 2020 The realtime manufacturing system is subject to different kinds of disruptions such as new job arrivals, machine breakdowns, and jobs cancellation. These different disruptions affect the original schedule that should be updated to maintain the system's ...
Kaouther Ben Ali +2 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
A Multi-Criteria Assessment of Manufacturing Cell Performance Using the AHP Method
Applied Sciences, 2022 Research of manufacturing cell design problems is still pertinent today, because new manufacturing strategies, such as mass customization, call for further improvement of the fundamental performance of cellular manufacturing systems.
Zuzana Soltysova +2 more
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
Mathematics, 2023 As multi-factory production models are more widespread in modern manufacturing systems, a distributed blocking flowshop scheduling problem (DBFSP) is studied in which no buffer between adjacent machines and setup time constraints are considered.
Chenyao Zhang +4 more
doaj +1 more source