A robust basic cyclic scheduling problem

DOI10.1007/s13675-018-0100-3zbMath1411.90168OpenAlexW2781894252WikidataQ129447220 ScholiaQ129447220MaRDI QIDQ668955

Idir Hamaz, Laurent Houssin, Sonia Cafieri

Publication date: 19 March 2019

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-018-0100-3

zbMATH Keywords

dynamic programmingrobust optimizationcyclic scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

The robust cyclic job shop problem ⋮ A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty ⋮ Scheduling jobs with normally distributed processing times on parallel machines ⋮ Scheduling with uncertain processing times in mixed-criticality systems

Cites Work

• Robust optimization for the cyclic hoist scheduling problem
• Robust location transportation problems under uncertain demands
• On 2-stage robust LP with RHS uncertainty: complexity results and applications
• The basic cyclic scheduling problem with deadlines
• A general model for cyclic machine scheduling problems
• Negative-cycle detection algorithms
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• Cyclic scheduling in a robotic production line
• Adjustable robust solutions of uncertain linear programs
• A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
• The basic cyclic scheduling problem with linear precedence constraints
• Dioïds and semirings: Links to fuzzy sets and other applications
• Throughput optimization in robotic cells
• The resource-constrained modulo scheduling problem: an experimental study
• The Price of Robustness
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: A robust basic cyclic scheduling problem