The resource-constrained activity insertion problem with minimum and maximum time lags

DOI10.1007/s10951-009-0124-xzbMath1176.90192OpenAlexW2063451334MaRDI QIDQ1041351

Christian Artigues, Cyril Briand

Publication date: 2 December 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-009-0124-x

zbMATH Keywords

complexityminimum and maximum time lagsresource-constrained project schedulingactivity insertion problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources

Cites Work

• Insertion of a random task in a schedule: a real-time approach
• A classification of predictive-reactive project scheduling procedures
• Feasible insertions in job shop scheduling, short cycles and stable sets
• Tabu-search for the multi-mode job-shop problem
• Insertion techniques for static and dynamic resource-constrained project scheduling.
• A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
• A lower bound for the job insertion problem.
• The construction of stable project baseline schedules
• Feasible job insertions in the multi-processor-task job shop
• Rescheduling manufacturing systems: A framework of strategies, policies, and methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item