Results 91 to 100 of about 13,809 (278)
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
Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation
Applied Sciences, 2020 Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy.
Xuelian Pang +4 more
doaj +1 more source
A Two‐Stage Optimization Model for Multiple‐Crane Service Schedules Problem
Advances in Civil Engineering, Volume 2026, Issue 1, 2026.Scheduling tower crane movements is essential in a large construction site where multiple cranes are deployed. Efficient planning can avoid potential crane collisions, reduce construction duration, and save energy consumption. The multiple‐crane service schedules problem (MCSSP) is a classic combinatorial problem.
Wen-Qi Wang +6 more
wiley +1 more source
Scheduling parallel jobs to minimize the makespan [PDF]
Journal of Scheduling, 2006 ISSN:1094 ...
openaire +2 more sources
Resource-constrained project scheduling for timely project completion with stochastic activity durations. [PDF]
We investigate resource-constrained project scheduling with stochastic activity durations. Various objective functions related to timely project completion are examined, as well as the correlation between these objectives. We develop a GRASP-heuristic to
Leus, Roel, Ballestin, F.
core
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.
Sanjoy K. Baruah +2 more
openaire +4 more sources
Online Makespan Minimization: The Power of Restart
CoRR, 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 ...
Zhiyi Huang 0002 +4 more
openaire +4 more sources
A Two-Machine Learning Date Flow-Shop Scheduling Problem with Heuristics and Population-Based GA to Minimize the Makespan [PDF]
, 2023 Jianyou Xu +5 more
openalex +1 more source
A classification of predictive-reactive project scheduling procedures. [PDF]
The vast majority of the project scheduling research efforts over the past several years have concentrated on the development of workable predictive baseline schedules, assuming complete information and a static and deterministic environment.
Herroelen, Willy +2 more
core