The fixed job schedule problem with spread-time constraints
Operations Research
Approximation algorithms for fixed job schedule problems
Operations Research - Supplement
Genetic Algorithms and Grouping Problems
Genetic Algorithms and Grouping Problems
Heuristic Algorithm for Fixed Job Scheduling Problem
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 05
A new representation and operators for genetic algorithms applied to grouping problems
Evolutionary Computation
A new grouping genetic algorithm approach to the multiple traveling salesperson problem
Soft Computing - A Fusion of Foundations, Methodologies and Applications
| Hi-index | 0.01 |
In a scheduling problem, a job is said to be fixed when its due date corresponds exactly to its release date plus its processing time. This paper addresses the fixed job scheduling problem where processors are subject to spread time constraints, i.e., the amount of time spent between the starting time of the first job on a processor and the completion time of the last job on the same processor should not exceed a given duration. Existing exact approaches are tested on medium size instances. As large instances are clearly intractable with these approaches, a greedy heuristic and a grouping genetic algorithm are proposed. Computational results show the effectiveness of the proposed heuristics.