Results 91 to 100 of about 14,397 (225)

A Hybrid Kepler Optimization Algorithm Based on Q-Learning for Solving Permutation Flow Shop Scheduling Problems

IEEE Access
The permutation flow shop scheduling problem (PFSP) is a significant challenge in production scheduling, considerably impacting industrial efficiency and competitiveness.
Xiangbo Qi, Zhijing Zhang, Jiaxi Zhang, Yan Song   +3 more
doaj   +1 more source

Scheduling parallel jobs to minimize the makespan [PDF]

Journal of Scheduling, 2006
We consider the NP-hard problem of scheduling parallel jobs with release dates on identical parallel machines to minimize the makespan. A parallel job requires simultaneously a prespecified, job-dependent number of machines when being processed. We prove that the makespan of any nonpreemptive list-schedule is within a factor of 2 of the optimal ...
openaire   +3 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  

A greedy algorithm for computing finite-makespan controllable sublanguages

, 2012
The Ramadge-Wonham supervisory control paradigm has been shown effective in dealing with logic control. Nevertheless, time-related performance is always one of the major concerns in industry.
Rong Su, Su, Rong.
core   +1 more source

An Efficient Task Scheduling for Cloud Computing Platforms Using Energy Management Algorithm: A Comparative Analysis of Workflow Execution Time

IEEE Access
Cloud computing platform offers numerous applications and resources such as data storage, databases, and network building. However, efficient task scheduling is crucial for maximizing the overall execution time.
Adeel Ahmed, Muhammad Adnan, Saima Abdullah, Israr Ahmad, Nazik Alturki, Leila Jamel   +5 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.
Sanjoy K. Baruah, Arvind Easwaran, Zhishan Guo   +2 more
openaire   +4 more sources

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, Van de Vonder, Stijn, Demeulemeester, Erik   +2 more
core  

A Hybrid Crow Search Algorithm for Solving Permutation Flow Shop Scheduling Problems

Applied Sciences, 2019
The permutation flow shop scheduling problem (PFSP) is a renowned problem in the scheduling research community. It is an NP-hard combinatorial optimization problem that has useful real-world applications.
Ko-Wei Huang, Abba Suganda Girsang, Ze-Xue Wu, Yu-Wei Chuang   +3 more
doaj   +1 more source

Makespan analysis for EHJSO method with existing system.

, 2023
Makespan analysis for EHJSO method with existing system.
D. Paulraj (14784530), T. Sethukarasi (14784533), M. Prakash (1464505), E. Baburaj (14784539), S. Neelakandan (14784536)   +4 more
core   +1 more source

The trade-off between stability and makespan in resource-constrained project scheduling. [PDF]

During the last decade a lot of research efforts in the project scheduling literature have concentrated on resource-constrained project scheduling under uncertainty.
Herroelen, Willy, Van de Vonder, Stijn, Demeulemeester, Erik, Leus, Roel   +3 more
core   +2 more sources