Results 21 to 30 of about 2,111 (188)
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 +3 more sources
On Minimizing Generalized Makespan on Unrelated Machines
CoRR, 2023 We consider the Generalized Makespan Problem (GMP) on unrelated machines, where we are given $n$ jobs and $m$ machines and each job $j$ has arbitrary processing time $p_{ij}$ on machine $i$. Additionally, there is a general symmetric monotone norm $ψ_i$ for each machine $i$, that determines the load on machine $i$ as a function of the sizes of jobs ...
Nikhil Ayyadevara +2 more
openaire +4 more sources
Bio-Inspired Workflow Scheduling on HPC Platforms
Tehnički Glasnik, 2021 Efficient scheduling of tasks in workflows of cloud or grid applications is a key to achieving better utilization of resources as well as timely completion of the user jobs. Many scientific applications comprise several tasks that are dependent in nature
Mandeep Kaur, Sanjay Kadam
doaj
Minimizing makespan in hybrid flowshops
Operations Research Letters, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA ( host institution ) +2 more
openaire +3 more sources
Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time
Scientific Reports, 2023 Makespan dominates the manufacturing expenses in bakery production. The high energy consumption of ovens also has a substantial impact, which bakers may overlook.
Majharulislam Babor +3 more
doaj +1 more source
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
Multi-Task Simultaneous Supervision
Jurnal Teknik IndustriThis paper focuses on developing a Multi-Task Simultaneous Supervision Dual Resource-Constrained Scheduling (MTSSDRC) system that considers differences in skill between operators, aiming to minimize makespan and balance operator workload.
Afifah Rizka +2 more
doaj +1 more source
Task stalling for a batch of task makespan minimisation in heterogeneous multigrid computing
Computational Science and Techniques, 2021 This paper presents a new algorithm for a batch of task makespan minimisation in heterogeneous multigrid computing. Heterogeneous grids are known to cause straggling task problem that increases task execution makespan.
Albertas Jurgelevičius +2 more
doaj +1 more source
A Self-Adaptive Memetic Algorithm for Distributed Job Shop Scheduling Problem
MathematicsDistributed scheduling has become a common manufacturing mode, and the distributed job scheduling problem (DJSP) has attracted more manufacturers and researchers in the field of operation research.
Guangchen Wang +2 more
doaj +1 more source
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 +2 more sources