Minimizing late jobs in the general one machine scheduling problem
type: Item
instance of: scholarly article
title: Minimizing late jobs in the general one machine scheduling problem
zbMATH Open document ID: 0913.90166
DOI: 10.1016/0377-2217(94)00116-T
author: Stèphane Dauzère-Pérès
published in: European Journal of Operational Research
publication date: 1998-08-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1191355
zbMATH Keywords: minimizing the number of late jobs
zbMATH Keywords: one machine
zbMATH Keywords: release dates
zbMATH Keywords: different due dates
zbMATH Keywords: lower bound
zbMATH Keywords: heuristic
MaRDI profile type: Publication
cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program
cites work: On the complexity of generalized due date scheduling problems
cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
cites work: Q3940839
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
full work available at URL: 0377-2217(94)00116-t
OpenAlex ID: W2086491340
description: scientific article; zbMATH DE number 1191355