A linear time algorithm for restricted bin packing and scheduling problems
type: Item
instance of: scholarly article
title: A linear time algorithm for restricted bin packing and scheduling problems
zbMATH Open document ID: 0507.90046
DOI: 10.1016/0167-6377(83)90042-1
author: Klaus H. Ecker
author: Jacek Blazewicz
published in: Operations Research Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3801286
zbMATH Keywords: bin packing
zbMATH Keywords: finite set of possible weights of elements
zbMATH Keywords: linear time algorithm
zbMATH Keywords: task scheduling
MaRDI profile type: Publication
full work available at URL: 0167-6377(83)90042-1
OpenAlex ID: W2065394292
cites work: Q3940840
cites work: Deadline scheduling of tasks with ready times and resource constraints
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Resource constrained scheduling as generalized bin packing
cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints
cites work: Q4198056
cites work: Q4170510
cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
cites work: Q4113925
cites work: Bin packing can be solved within 1+epsilon in linear time
description: scientific article; zbMATH DE number 3801286