Minimizing the weighted number of tardy jobs on parallel processors
type: Item
instance of: scholarly article
title: Minimizing the weighted number of tardy jobs on parallel processors
zbMATH Open document ID: 1067.90047
author: Rym M'Hallah
author: Robert L. Bulfin
published in: European Journal of Operational Research
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2117518
zbMATH Keywords: Scheduling
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Branch and bound
zbMATH Keywords: Surrogate relaxation
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.06.027
OpenAlex ID: W2086172248
cites work: Solving Parallel Machine Scheduling Problems by Column Generation
cites work: An O(n) algorithm for the multiple-choice knapsack linear program
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Minimizing the number of tardy jobs for \(m\) parallel machines
cites work: Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
cites work: Minimizing the weighted number of tardy jobs on a single machine
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Q4040299
cites work: Parallel machine scheduling by column generation
DOI: 10.1016/J.EJOR.2003.06.027
description: scientific article; zbMATH DE number 2117518