Minimizing the number of late jobs on unrelated machines
type: Item
instance of: scholarly article
title: Minimizing the number of late jobs on unrelated machines
zbMATH Open document ID: 0734.90042
DOI: 10.1016/0167-6377(91)90032-K
author: Joseph Y.-T. Leung
author: Jian-Zhong Du
published in: Operations Research Letters
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 4215664
zbMATH Keywords: preemptive scheduling
zbMATH Keywords: due date
zbMATH Keywords: independent jobs with release times
zbMATH Keywords: unrelated machines
zbMATH Keywords: number of late jobs
zbMATH Keywords: strong NP-hardness
MaRDI profile type: Publication
cites work: Q4016820
cites work: Q4198056
cites work: Q3899811
cites work: Q3206646
cites work: Q3339651
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
description: scientific article; zbMATH DE number 4215664