Results 11 to 20 of about 22,962 (193)
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
Minimum Makespan Multi-Vehicle Dial-a-Ride [PDF]
ACM Transactions on Algorithms, 2009 Dial-a-Ride problems consist of a setVofnvertices in a metric space (denoting travel time between vertices) and a set ofmobjects represented as source-destination pairs {(si,ti)}mi=1, where each object requires to be moved from its source to destination vertex.
Gørtz, Inge Li +2 more
openaire +12 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
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem [PDF]
, 2014 As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the ...
Fernández-Viagas Escudero, Víctor +1 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