Satisfiability tests and time-bound adjustments for cumulative scheduling problems
From MaRDI portal
Publication:1960325
DOI10.1023/A:1018995000688zbMath0958.90037OpenAlexW1515176649MaRDI QIDQ1960325
Philippe Baptiste, Wim Nuijten, Claude le Pape
Publication date: 11 January 2000
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018995000688
resource-constrained project schedulingresource constraintscumulative schedulingtime-bound adjustments
Related Items
IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem, Energetic reasoning revisited: Application to parallel machine scheduling, Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search, Resource loading with time windows, Computing redundant resources for the resource constrained project scheduling problem, A branch-and-check approach for a wind turbine maintenance scheduling problem, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem, The consistent electric-vehicle routing problem with backhauls and charging management, An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem, A preemptive bound for the resource constrained project scheduling problem, Lower bounds for the event scheduling problem with consumption and production of resources, Constraint propagation on GPU: a case study for the cumulative constraint, Project scheduling with finite or infinite number of activity processing modes -- a survey, On linear lower bounds for the resource constrained project scheduling problem., Scheduling jobs on parallel machines to minimize a regular step total cost function, An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem, Methods to solve multi-skill project scheduling problem, Branch-and-price approach for the multi-skill project scheduling problem, A new constraint programming approach for the orthogonal packing problem, Search tree based approaches for parallel machine scheduling, Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem, Scheduling production of multiple part-types in a system with pre-known demands and deterministic inactive time intervals, Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage, Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem, Global propagation of side constraints for solving over-constrained problems, Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines., Jackson's pseudo-preemptive schedule and cumulative scheduling problems, Optimal parallel machines scheduling with availability constraints, A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem, A survey of variants and extensions of the resource-constrained project scheduling problem, Resource-constrained project scheduling: Notation, classification, models, and methods, Cut generation for an integrated employee timetabling and production scheduling problem, Packing-based branch-and-bound for discrete malleable task scheduling, A new LP-based lower bound for the cumulative scheduling problem, Two deadline reduction algorithms for scheduling dependent tasks on parallel processors, Energetic reasoning for energy-constrained scheduling with a continuous resource
