Results 21 to 30 of about 14,397 (225)
On the Minimization of the Makespan Subject to Flowtime Optimality [PDF]
Operations Research, 1993 When scheduling n jobs on m identical machines in parallel, two performance criteria are of particular interest: the makespan (the completion time of the last job) and the flowtime (the sum of the completion times of all n jobs). Whereas minimizing makespan is NP-hard, many schedules minimize flowtime, and they are easy to characterize.
Brian Thomas Eck, Michael L. Pinedo
openaire +2 more sources
Perancangan Sistem Penjadwalan Mesin Hybrid Flow Shop dengan Algoritma Levyflight Discrete Firefly
ComTech, 2014 The main issues that have been encountered in PT Surya Toto Indonesia is companies do not know how to measure the performance of the production process so as the utilization of resources that will be used isn’t yet to be known with efficiently.
Andrew Verrayo Limas +2 more
doaj +1 more source
AdPSO: Adaptive PSO-Based Task Scheduling Approach for Cloud Computing
Sensors, 2022 Cloud computing has emerged as the most favorable computing platform for researchers and industry. The load balanced task scheduling has emerged as an important and challenging research problem in the Cloud computing.
Said Nabi +3 more
doaj +1 more source
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
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 +5 more sources
A Modified Multi-Step Crossover Fusion (MSXF) In Solving Some Deterministic Job Shop Scheduling Problem (JSSP) [TS157.5. M214 2008 f rb]. [PDF]
, 2008 This thesis addresses the job shop scheduling problem (JSSP) with the objective of minimising the makespan value. Tesis ini membincangkan masalah penskedulan kerja kedaian (JSSP) dengan objektif untuk meminimumkan masa ...
Omar, Mahanim
core +1 more source
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
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 +4 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 +5 more sources