A metaheuristic for the fixed job scheduling problem under spread time constraints

DOI10.1016/j.cor.2009.09.007zbMath1178.90162OpenAlexW2001206480MaRDI QIDQ2654393

André Rossi, Alok Singh, Marc Sevaux

Publication date: 15 January 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.09.007

zbMATH Keywords

genetic algorithmsfixed job schedulingspread time constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem ⋮ A constraint-based approach for the shift design personnel task scheduling problem with equity

Uses Software

• XPRESS

Cites Work

• Unnamed Item
• Two heuristics for the one-dimensional bin-packing problem
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Interval scheduling on identical machines
• Spread time considerations in operational fixed job scheduling
• The Fixed Job Schedule Problem with Spread-Time Constraints
• Approximation Algorithms for Fixed Job Schedule Problems
• Theoretical Computer Science

This page was built for publication: A metaheuristic for the fixed job scheduling problem under spread time constraints