Results 101 to 110 of about 14,397 (225)
Journal of Marine Science and EngineeringThis paper investigates the energy-efficient collaborative scheduling of dual-trolley quay cranes (DTQCs) and automated guided vehicles (AGVs) in automated container terminals (ACTs). Considering operational constraints such as mixed bidirectional flows,
Shichang Xiao +4 more
doaj +1 more source
Bounding the Makespan of Transaction Schedules.
The performance of transactional database systems is typically evaluated by measuring the amount of transactions they can commit to the database per second. However, fairly measuring this for the same workload on different systems is not trivial. It is therefore relevant to formalize schedule efficiency, investigate the space of all possible efficient ...
Tim Baccaert +2 more
openaire +3 more sources
Online Makespan Scheduling under Scenarios
CoRRWe consider a natural extension of online makespan scheduling on identical parallel machines by introducing scenarios. A scenario is a subset of jobs, and the task of our problem is to find a global assignment of the jobs to machines so that the maximum makespan under a scenario, i.e., the maximum makespan of any schedule restricted to a scenario, is ...
openaire +3 more sources
Improved online load balancing with known makespan [PDF]
We break the barrier of $3/2$ for the problem of online load balancing with known makespan, also known as bin stretching. In this problem, $m$ identical machines and the optimal makespan are given.
Lieskovský, Matej +4 more
core +4 more sources
The complexity of generating robust resource-constrained baseline schedules. [PDF]
Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that will change little when variations in the input parameters arise.
Herroelen, Willy, Leus, Roel
core
Mean makespan task scheduling approach for the edge computing environment [PDF]
Task scheduling in the edge computing environment poses significant challenges due to its inherent NP-hard nature. Several researchers concentrated on minimizing simple makespan, disregarding the reduction of the mean time to complete all tasks ...
Kumar, Jitender, Saini, Nisha
core +1 more source
Makespan - NASA Ames iPSC/860 Dataset.
, 2016 Makespan - NASA Ames iPSC/860 Dataset.
Mohammed Abdullahi (846140) +1 more
core +1 more source
Automatic Construction Method of Surrogate Evaluation Measures for Job Shop Scheduling
SystemsJob shop scheduling holds significant importance due to its relevance and impact on various industrial and manufacturing systems. Aiming at the job shop scheduling problem with random machine breakdowns, a multi-objective optimization model is ...
Zigao Wu, Shichang Xiao, Shaohua Yu
doaj +1 more source
Energy-Efficient Dynamic Workflow Scheduling in Cloud Environments Using Deep Learning
SensorsDynamic workflow scheduling in cloud environments is a challenging task due to task dependencies, fluctuating workloads, resource variability, and the need to balance makespan and energy consumption.
Sunera Chandrasiri, Dulani Meedeniya
doaj +1 more source
Dynamic Job Shop Scheduling Problem With New Job Arrivals Using Hybrid Genetic Algorithm
IEEE AccessThe present paper tackles the dynamic job shop scheduling problem (DJSSP), aiming to schedule a new set of jobs while minimizing the completion time of all operations. The problem is an NP-hard combinatorial optimization problem.
Kaouther Ben Ali +4 more
doaj +1 more source