Results 31 to 40 of about 4,494 (215)
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
MINIMIZING THE MAKESPAN FOR UNRELATED PARALLEL MACHINES [PDF]
International Journal on Artificial Intelligence Tools, 2007 In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results than the traditional SA and developed an effective ...
GUO, Yunsong +3 more
openaire +3 more sources
Multi-Task Simultaneous Supervision
Jurnal Teknik IndustriThis paper focuses on developing a Multi-Task Simultaneous Supervision Dual Resource-Constrained Scheduling (MTSSDRC) system that considers differences in skill between operators, aiming to minimize makespan and balance operator workload.
Afifah Rizka +2 more
doaj +1 more source
Task stalling for a batch of task makespan minimisation in heterogeneous multigrid computing
Computational Science and Techniques, 2021 This paper presents a new algorithm for a batch of task makespan minimisation in heterogeneous multigrid computing. Heterogeneous grids are known to cause straggling task problem that increases task execution makespan.
Albertas Jurgelevičius +2 more
doaj +1 more source
A Self-Adaptive Memetic Algorithm for Distributed Job Shop Scheduling Problem
MathematicsDistributed scheduling has become a common manufacturing mode, and the distributed job scheduling problem (DJSP) has attracted more manufacturers and researchers in the field of operation research.
Guangchen Wang +2 more
doaj +1 more source
Scheduling parallel jobs to minimize the makespan [PDF]
Journal of Scheduling, 2006 ISSN:1094 ...
openaire +3 more sources
International Transactions in Operational Research, EarlyView.Abstract In the last decade, explainability has been attracting much attention in the machine learning community. However, this research topic extends beyond this field to encompass others such as operations research and combinatorial optimization (CO).
Mathieu Lerouge +3 more
wiley +1 more source
A sequencing algorithm for makespan minimization in FMS [PDF]
Journal of Manufacturing Technology Management, 2004 Job sequencing is an important stage in any hierarchical production control model, especially when a real‐time dispatching rule is not employed. The problems become complicated when constraints, such as different parts requiring different operation processes at different machines and with different production priorities, are taken into consideration in
Lee, JSL, Choi, SH
openaire +4 more sources
International Transactions in Operational Research, Volume 33, Issue 2, Page 860-891, March 2026.Abstract Sustainability has become one of the main objectives in all human activities and, in particular, in manufacturing environments. In this paper, we consider the flexible job shop scheduling problem with the objective of minimizing energy consumption.
Ernesto G. Birgin +2 more
wiley +1 more source
Production Time Optimization using Campbell Dudek Smith (CDS) Algorithm for Production Scheduling [PDF]
E3S Web of Conferences, 2019 The production time optimization study used the Campbell Dudek smith (CDS) algorithm in the production process scheduling aimed at makespan optimization for engine operation to produce 12-size pan products, 14-size griddle, 16-size griddle, 18-size ...
Mashuri Chamdan +4 more
doaj +1 more source