A new LP-based lower bound for the cumulative scheduling problem

DOI10.1016/S0377-2217(99)00494-4zbMath0990.90036OpenAlexW2053615234MaRDI QIDQ1590042

Emmanuel Néron, Jacques Carlier

Publication date: 19 December 2000

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00494-4

zbMATH Keywords

linear programmingresource constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Computing redundant resources for the resource constrained project scheduling problem, An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, A survey of dual-feasible and superadditive functions, A preemptive bound for the resource constrained project scheduling problem, On linear lower bounds for the resource constrained project scheduling problem., An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem, Consecutive ones matrices for multi-dimensional orthogonal packing problems, New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem

Uses Software

• BL data set

Cites Work

• Unnamed Item
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
• A branch and bound algorithm for the resource-constrained project scheduling problem
• Resource-constrained project scheduling. Exact methods for the multi-mode case
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems