Results 21 to 30 of about 13,809 (278)
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
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
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
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
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
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
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
Minimizing makespan in a pallet-constrained flowshop [PDF]
, 1998 We consider the problem of scheduling n jobs in a pallet-constrained flowshop so as to minimize the makespan. In such a flowshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of the last ...
Sriskandarajah, C. +4 more
core +2 more sources