Analysis of the temporal decomposition procedure for scheduling with release and due dates

DOI10.1016/S0377-2217(97)00176-8zbMath0943.90039OpenAlexW2031761618MaRDI QIDQ1303726

Besoa Rabenasolo, Michel Happiette, Zeng, Xianyi

Publication date: 16 September 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00176-8

zbMATH Keywords

complexityschedulingprobabilistic analysistemporal decomposition

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances

Cites Work

• Unnamed Item
• The job-shop problem and immediate selection
• Simulation studies in JIT production
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• An Algorithm for Solving the Job-Shop Problem
• Dominance and Decomposition Heuristics for Single Machine Scheduling
• A heuristic for designing cellular manufacturing facilities

This page was built for publication: Analysis of the temporal decomposition procedure for scheduling with release and due dates