Linear programming based algorithms for preemptive and non-preemptive RCPSP
type: Item
instance of: scholarly article
title: Linear programming based algorithms for preemptive and non-preemptive RCPSP
zbMATH Open document ID: 1121.90055
author: Jean Damay
author: Eric Sanlaville
author: Alain Quilliot
published in: European Journal of Operational Research
publication date: 2007-06-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5163870
zbMATH Keywords: scheduling
zbMATH Keywords: resource constrained project
zbMATH Keywords: preemption
zbMATH Keywords: linear programming
zbMATH Keywords: column generation
describes a project that uses: PSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.09.052
OpenAlex ID: W2066447358
cites work: Tight LP bounds for resource constrained project scheduling
cites work: Représentation de familles ordonnées d'intervalles et applications
cites work: A linear programming and constraint propagation-based lower bound for the RCPSP
cites work: Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
cites work: An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
cites work: PSPLIB -- a project scheduling problem library
cites work: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
cites work: Solving Project Scheduling Problems by Minimum Cut Computations
cites work: A relation between multiprocessor scheduling and linear programming
cites work: Optimal preemptive scheduling on a fixed number of identical parallel machines
cites work: Resource constraints for preemptive job-shop scheduling
cites work: A branch and bound algorithm for the resource-constrained project scheduling problem
DOI: 10.1016/J.EJOR.2006.09.052
Recommended article: Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
Recommended article: Computing optimal preemptive schedules for parallel tasks: linear programming approaches
Recommended article: Branch-and-Cut-and-Price algorithms for the preemptive RCPSP
Recommended article: Preemptive Scheduling, Linear Programming and Network Flows
Recommended article: A linear programming and constraint propagation-based lower bound for the RCPSP
Recommended article: On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
Recommended article: Q4737537
Recommended article: Solving LP Relaxations of Large-Scale Precedence Constrained Problems
Recommended article: Line search method for solving a non-preemptive strictly periodic scheduling problem
description: scientific article; zbMATH DE number 5163870