Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
type: Item
instance of: scholarly article
title: Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
zbMATH Open document ID: 1412.90054
author: Margaux Nattaf
author: Markó Horváth
author: Tamás Kis
author: Christian Artigues
author: Pierre Lopez
published in: Discrete Applied Mathematics
publication date: 2019-03-22T00:00:00Z
full work available at URL: http://eprints.sztaki.hu/9790/
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7040835
zbMATH Keywords: continuous scheduling
zbMATH Keywords: continuous resources
zbMATH Keywords: linear efficiency functions
zbMATH Keywords: mixed integer programming
zbMATH Keywords: valid inequalities
zbMATH Keywords: polyhedral combinatorics
MaRDI profile type: Publication
OpenAlex ID: W2615061682
cites work: Energetic reasoning for energy-constrained scheduling with a continuous resource
cites work: Q2735585
cites work: Scheduling malleable tasks on parallel processors to minimize the makespan
cites work: Q4149476
cites work: A priority-rule method for project scheduling with work-content constraints
cites work: Connected and alternating vectors: Polyhedra and algorithms
cites work: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
cites work: Resource-constrained project scheduling with flexible resource profiles in continuous time
cites work: MIP models for resource-constrained project scheduling with flexible resource profiles
cites work: A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
cites work: Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions
cites work: Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
cites work: Project scheduling with finite or infinite number of activity processing modes -- a survey
Wikidata QID: Q128610579
DOI: 10.1016/J.DAM.2018.11.008
description: scientific article; zbMATH DE number 7040835