Results 21 to 30 of about 22,962 (193)
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
Discrete parallel machine makespan ScheLoc problem [PDF]
Journal of Combinatorial Optimization, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hessler, Corinna, Deghdak, Kaouthar
openaire +4 more sources
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
Reduction of permutation flowshop problems to single machine problems using machine dominance relations [PDF]
, 2017 The Permutation Flowshop Scheduling Problem with Makespan objective (PFSP-M) is known to be NP-hard for more than two machines, and literally hundreds of works in the last decades have proposed exact and approximate algorithms to solve it. These works—of
Fernández-Viagas Escudero, Víctor +1 more
core +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
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
A bi-objective genetic algorithm approach to risk mitigation in project scheduling [PDF]
, 2008 A problem of risk mitigation in project scheduling is formulated as a bi-objective optimization problem, where the expected makespan and the expected total cost are both to be minimized.
Kilic, Murat +5 more
core +2 more sources