Minimizing the number of late jobs on a single machine under due date uncertainty
type: Item
instance of: scholarly article
title: Minimizing the number of late jobs on a single machine under due date uncertainty
zbMATH Open document ID: 1229.90053
author: Hassene Aissi
author: Mohamed Ali Aloulou
author: M. Y. Kovalyov
published in: Journal of Scheduling
publication date: 2012-01-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5997880
zbMATH Keywords: scheduling
zbMATH Keywords: single machine
zbMATH Keywords: uncertainty
zbMATH Keywords: scenarios
zbMATH Keywords: min-max approach
zbMATH Keywords: robustness
zbMATH Keywords: assignment
MaRDI profile type: Publication
full work available at URL: s10951-010-0183-z
OpenAlex ID: W1994217000
cites work: Scheduling Problems with Two Competing Agents
cites work: Complexity of the min-max and min-max regret assignment problems
cites work: Complexity of single machine scheduling problems under scenario-based uncertainty
cites work: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
cites work: Q4198056
cites work: Maximum matching of given weight in complete and complete bipartite graphs
cites work: Robust discrete optimization and its applications
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Matching is as easy as matrix inversion
cites work: The complexity of restricted spanning tree problems
DOI: 10.1007/S10951-010-0183-Z
description: scientific article; zbMATH DE number 5997880