Scheduling and constraint propagation

DOI10.1016/S0166-218X(01)00342-0zbMath1018.90013MaRDI QIDQ697570

Peter Brucker

Publication date: 17 September 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithmlinear programmingmachine schedulingconstraint propagationproject scheduling/resource constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Heuristic approach for minimizing the projection error in the integrated mapping, Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming, Multiobjective project portfolio selection with fuzzy constraints, Scheduling coordination problems in supply chain planning, An updated survey of variants and extensions of the resource-constrained project scheduling problem, New model and heuristics for safety stock placement in general acyclic supply chain networks, Continuous filling and emptying of storage systems in constraint-based scheduling, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, A survey of variants and extensions of the resource-constrained project scheduling problem, Immediate schedule adjustment and semidefinite relaxation, A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem

Uses Software

• JOBSHOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• A tabu search approach for the resource constrained project scheduling problem
• A genetic algorithm for multi-mode resource constrained project scheduling problem
• A branch and bound algorithm for the resource-constrained project scheduling problem
• A new tabu search procedure for an audit-scheduling problem
• A branch and bound algorithm for the job-shop scheduling problem
• The job-shop problem and immediate selection
• Adjustment of heads and tails for the job-shop problem
• Current trends in deterministic scheduling
• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Tabu search for resource-constrained scheduling
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
• An Algorithm for Solving the Job-Shop Problem
• A Computational Study of the Job-Shop Scheduling Problem
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Adaptive search for solving hard project scheduling problems
• Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
• Solving the open shop scheduling problem