Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
type: Item
instance of: scholarly article
zbMATH Open document ID: 0995.90039
author: O. A. Yanushkevich
author: V. S. Gordon
author: Frank Werner
publication date: 2002-06-16T00:00:00Z
full work available at URL: http://www.numdam.org/item
full work available at URL: https://eudml.org/doc/197794
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1694887
zbMATH Keywords: single machine scheduling
zbMATH Keywords: release and due dates
zbMATH Keywords: deadlines
zbMATH Keywords: number of late jobs
Wikidata QID: Q57633956
MaRDI profile type: Publication
OpenAlex ID: W2001396591
cites work: Single machine scheduling with deadlines, release and due dates
cites work: Q3755224
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4142699
cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
cites work: Q4099215
cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
cites work: Complexity results for scheduling chains on a single machine
cites work: Q4124328
cites work: Linear-Time Algorithms for Scheduling on Parallel Processors
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Q5181074
cites work: Q3318519
cites work: Q4323632
DBLP publication ID: journals/rairo/GordonWY01
DOI: 10.1051/RO:2001103
title: Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
published in: RAIRO. Operations Research
description: scientific article; zbMATH DE number 1694887