Reducing the feasible region to a scheduling problem
type: Item
instance of: scholarly article
title: Reducing the feasible region to a scheduling problem
zbMATH Open document ID: 0755.90046
DOI: 10.1080/02331939108843733
published in: Optimization
publication date: 1992-06-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 26846
zbMATH Keywords: project scheduling
zbMATH Keywords: partially ordered set of continuously divisible activities
zbMATH Keywords: resource constraints
zbMATH Keywords: project completion time
zbMATH Keywords: front
zbMATH Keywords: maximal cycle-free sets of fronts
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/02331939108843733
OpenAlex ID: W1971830479
description: scientific article; zbMATH DE number 26846