Results 101 to 110 of about 13,809 (278)
Power-aware scheduling for makespan and flow [PDF]
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, 2006 We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem when every job requires the same ...
openaire +4 more sources
MINIMASI MAKESPAN PADA PERSOALAN PENJADWALAN ORDERED FLOWSHOP MENGGUNAKAN PSO [PDF]
, 2021 Rizki Habibi +2 more
openalex +1 more source
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 +3 more sources
Makespan - NASA Ames iPSC/860 Dataset.
, 2016 Makespan - NASA Ames iPSC/860 Dataset.
Mohammed Abdullahi (846140) +1 more
core +1 more source
IEEE AccessThe permutation flow shop scheduling problem (PFSP) is a significant challenge in production scheduling, considerably impacting industrial efficiency and competitiveness.
Xiangbo Qi +3 more
doaj +1 more source
Approximation results for flow shop scheduling problems with machine availability constraints [PDF]
, 2009 This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing ...
Strusevich, Vitaly A. +2 more
core +1 more source
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
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 +3 more
doaj +1 more source
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