Results 81 to 90 of about 4,494 (215)
Multi-Objective Scientific-Workflow Scheduling With Data Movement Awareness in Cloud
IEEE Access, 2019 Due to serving several purposes simultaneously, running scientific workflows on dynamic environments such as cloud computing, has become multi-objective scheduling.
Peerasak Wangsom +2 more
doaj +1 more source
mixed criticality scheduling to minimize makespan
, 2016 In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical.
Baruah, Sanjoy +2 more
openaire +5 more sources
Heuristic procedures for minimizing makespan and the number of required pallets [PDF]
, 1995 Chengbin Chu, J.-M. Proth, Suresh Sethi
openalex +1 more source
Online Makespan Minimization: The Power of Restart
, 2018 We consider the online makespan minimization problem on identical machines. Chen and Vestjens (ORL 1997) show that the largest processing time first (LPT) algorithm is 1.5-competitive. For the special case of two machines, Noga and Seiden (TCS 2001) introduce the SLEEPY algorithm that achieves a competitive ratio of $(5 - \sqrt{5})/2 \approx 1.382 ...
Huang, Zhiyi +4 more
openaire +4 more sources
Jurnal Teknik Industri, 2012 A new evolutionary computation algorithm, Superbug algorithm, which simulates evolution of bacteria in a culture, is proposed. The algorithm is developed for solving large scale optimization problems such as scheduling, transportation and assignment ...
Chandramouli Anandaraman +2 more
doaj
IEEE Access, 2018 Grey wolf optimization (GWO) algorithm is a new population-oriented intelligence algorithm, which is originally proposed to solve continuous optimization problems inspired from the social hierarchy and hunting behaviors of grey wolves. It has been proved
Tianhua Jiang, Chao Zhang
doaj +1 more source
Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity [PDF]
, 1997 M. Wang +3 more
openalex +1 more source
Minimizing makespan on a single batch processing machine with nonidentical job sizes [PDF]
, 2001 Guochuan Zhang +3 more
openalex +1 more source
EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES [PDF]
, 2001 Tara Javidi +2 more
openalex +1 more source
Minimization of the Makespan with a Discrete-Time State−Task Network Formulation [PDF]
, 2003 Christos T. Maravelias +1 more
openalex +1 more source