An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
type: Item
instance of: scholarly article
title: An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
zbMATH Open document ID: 1163.90494
author: Hans Kellerer
published in: Operations Research Letters
publication date: 2008-08-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5306935
zbMATH Keywords: scheduling
zbMATH Keywords: resource constraints
zbMATH Keywords: multiple choice knapsack
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.orl.2007.08.001
OpenAlex ID: W2004033524
cites work: Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
cites work: Machine scheduling with resource dependent processing times
cites work: Q4821303
DOI: 10.1016/J.ORL.2007.08.001
Recommended article: Identical parallel machine scheduling with time-dependent processing times
Recommended article: Approximation algorithms for parallel machine scheduling with speed-up resources
Recommended article: Approximation schemes for scheduling on uniformly related and identical parallel machines
Recommended article: Q4938775
Recommended article: Approximation schemes for machine scheduling with resource (in-)dependent processing times
Recommended article: Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times
Recommended article: An exact algorithm for the identical parallel machine scheduling problem.
Recommended article: An approximation algorithm for a parallel machine scheduling problem with constraints
Recommended article: Approximation schemes for scheduling on parallel machines
Recommended article: On the complexity of scheduling problems with a fixed number of parallel identical machines
description: scientific article; zbMATH DE number 5306935