Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
type: Item
instance of: scholarly article
title: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
zbMATH Open document ID: 0810.90070
DOI: 10.1016/0895-7177(94)90209-7
published in: Mathematical and Computer Modelling
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 706950
zbMATH Keywords: tower of sets
zbMATH Keywords: processing time
zbMATH Keywords: release date
zbMATH Keywords: due date
zbMATH Keywords: Moore-Hodgson algorithm
zbMATH Keywords: knapsack-like problem
zbMATH Keywords: nested inequality constraints
author: Eugene L. Lawler
MaRDI profile type: Publication
full work available at URL: 0895-7177(94)90209-7
OpenAlex ID: W1986168186
cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Q4099215
cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
description: scientific article; zbMATH DE number 706950