A new LP-based lower bound for the cumulative scheduling problem
type: Item
instance of: scholarly article
title: A new LP-based lower bound for the cumulative scheduling problem
zbMATH Open document ID: 0990.90036
DOI: 10.1016/S0377-2217(99)00494-4
author: Jacques Carlier
author: E. Néron
published in: European Journal of Operational Research
publication date: 2000-12-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 1545198
zbMATH Keywords: linear programming
zbMATH Keywords: resource constraints
describes a project that uses: BL data set
MaRDI profile type: Publication
cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems
cites work: A branch and bound algorithm for the resource-constrained project scheduling problem
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
cites work: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
cites work: Q5589310
cites work: Resource-constrained project scheduling. Exact methods for the multi-mode case
full work available at URL: s0377-2217(99)00494-4
OpenAlex ID: W2053615234
description: scientific article; zbMATH DE number 1545198