Single machine scheduling to minimize the number of late jobs under uncertainty.
type: Item
instance of: scholarly article
title: Single machine scheduling to minimize the number of late jobs under uncertainty.
zbMATH Open document ID: 1045.90033
DOI: 10.1016/S0165-0114(02)00505-5
author: S-C. Sung
author: Milan Vlach
published in: Fuzzy Sets and Systems
publication date: 2003-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2005409
zbMATH Keywords: Combinatorial problems
zbMATH Keywords: Scheduling
zbMATH Keywords: Single machine
zbMATH Keywords: Number of late jobs
MaRDI profile type: Publication
cites work: Q4396949
cites work: Note—A Note on Single Machine Sequencing with Random Processing Times
cites work: Q4376631
cites work: Q3995531
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
full work available at URL: s0165-0114(02)00505-5
OpenAlex ID: W1986661310
Recommended article: Minimizing the number of late jobs on a single machine under due date uncertainty
Recommended article: Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
Recommended article: Single-machine scheduling to stochastically minimize maximum lateness
Recommended article: Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
Recommended article: Q4858162
Recommended article: Single machine scheduling to minimize the number of early and tardy jobs
Recommended article: Q5437764
Recommended article: Single-machine scheduling to minimize earliness and number of tardy jobs
Recommended article: Stochastic Single Machine Scheduling to Minimize the Weighted Number of Tardy Jobs
description: scientific article; zbMATH DE number 2005409