Lower bounds for the event scheduling problem with consumption and production of resources
type: Item
instance of: scholarly article
title: Lower bounds for the event scheduling problem with consumption and production of resources
zbMATH Open document ID: 1382.90032
published in: Discrete Applied Mathematics
publication date: 2017-12-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6820614
zbMATH Keywords: scheduling problems
zbMATH Keywords: nonrenewable resources
zbMATH Keywords: makespan
zbMATH Keywords: lower bound
author: Jacques Carlier
author: A. Moukrim
author: Abderrahim Sahli
describes a project that uses: PSPLIB
MaRDI profile type: Publication
full work available at URL: j.dam.2016.05.021
OpenAlex ID: W2474901069
cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems
cites work: The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm
cites work: On linear lower bounds for the resource constrained project scheduling problem.
cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
cites work: Jackson's pseudo-preemptive schedule and cumulative scheduling problems
cites work: Scheduling subject to nonrenewable-resource constraints
cites work: PSPLIB -- a project scheduling problem library
cites work: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
cites work: Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
cites work: Q5289267
cites work: Project scheduling with inventory constraints
cites work: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
DOI: 10.1016/J.DAM.2016.05.021
description: scientific article; zbMATH DE number 6820614