Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
type: Item
instance of: scholarly article
title: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
zbMATH Open document ID: 0971.90026
author: Philippe Baptiste
published in: Journal of Scheduling
publication date: 2001-11-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 1402220
zbMATH Keywords: single-machine scheduling
zbMATH Keywords: preemptive scheduling
zbMATH Keywords: late jobs
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
cites work: Q4859840
cites work: Minimizing late jobs in the general one machine scheduling problem
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
DOI: 10.1002/(SICI)1099-1425(199911/12)2:6%3C245::AID-JOS28%3E3.0.CO;2-5
description: scientific article; zbMATH DE number 1402220