Cited By
View all- Gomatheeshwari BGopi KMathias A(2023)Low-complex resource mapping heuristics for mobile and iot workloads on NoC-HMPSoC architectureMicroprocessors & Microsystems10.1016/j.micpro.2023.10480298:COnline publication date: 1-Apr-2023
This study examines a dual-flow shop-scheduling problem that allows cross-shop processing. The scheduling objective is to minimize the coefficient of variation of slack time (lateness), where the slack time (ST) of a job denotes the difference between ...
Genetic algorithms were intensively investigated in various modifications and in combinations with other algorithms for solving the NP-hard scheduling problem. This extended abstract describes a genetic algorithm approach for solving large job shop ...
The problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedulelength can be minimized. This scheduling problem is known to be NP-hard, and methodsbased ...
Kluwer Academic Publishers
United States