A multiperiod single processor scheduling problem with periodic requirements

DOI10.1016/j.ejor.2004.09.046zbMath1116.90048OpenAlexW2130077470MaRDI QIDQ818097

Giuseppe Paletta

Publication date: 24 March 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.046

zbMATH Keywords

schedulingcombinatorial optimizationheuristic algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Management of periodic demands in distribution systems
• Optimal distribution strategies with cyclic demands
• Mean-variance approach to the management of cyclic deliveries
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• Technical Note—Optimal Scheduling of Periodic Activities
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: A multiperiod single processor scheduling problem with periodic requirements