Multi-Strategy Enhanced White Shark Optimizer for Solving Job Shop Scheduling Problem. [PDF]
Cao L +5 more
europepmc +1 more source
Clips: a capacity and lead time integrated procedure for scheduling. [PDF]
We propose a general procedure to address real life job shop scheduling problems. The shop typically produces a variety of products, each with its own arrival stream, its own route through the shop and a given customer due date.
Lambrecht, Marc +2 more
core
Reinforcement learning based multi objective task scheduling for energy efficient and cost effective cloud edge computing. [PDF]
Zhang W, Ou H.
europepmc +1 more source
Applying Machine Based Decomposition in 2-Machine Flow Shops [PDF]
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved ...
Chatterjee Ashis K, Mukherjee, Saral
core
Hybrid GA-DQL approach for efficient task mapping of IoT applications in fog computing framework. [PDF]
Tripathy N +3 more
europepmc +1 more source
A scalable scheduling and resource management framework for cloud-native B2B applications. [PDF]
Komarasamy D +3 more
europepmc +1 more source
A Goal Programming Model for Nurse Shift Scheduling Incorporating Flexible Constraints: A Case Study in an Operating Room Department. [PDF]
Demircioğlu M, Mutlu HE.
europepmc +1 more source
Predicting Nurse Turnover for Highly Imbalanced Data Using the Synthetic Minority Over-Sampling Technique and Machine Learning Algorithms. [PDF]
Xu Y, Park Y, Park JD, Sun B.
europepmc +1 more source
Solution and quality robust project scheduling: a methodological framework. [PDF]
The vast majority of the research efforts in project scheduling over the past several years has concentrated on the development of exact and suboptimal procedures for the generation of a baseline schedule assuming complete information and a deterministic
Herroelen, Willy, Leus, Roel
core

