An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
type: Item
instance of: scholarly article
title: An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
zbMATH Open document ID: 1013.90066
DOI: 10.1016/S0167-6377(02)00177-3
author: Mohamed Haouari
author: Anis Gharbi
published in: Operations Research Letters
publication date: 2003-05-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1903527
zbMATH Keywords: identical parallel machines
zbMATH Keywords: release dates
zbMATH Keywords: due dates
zbMATH Keywords: maximum lateness
zbMATH Keywords: lower bound
zbMATH Keywords: preemption
MaRDI profile type: Publication
cites work: Scheduling jobs with release dates and tails on identical machines to minimize the makespan
cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
cites work: Q4198056
cites work: Minimizing makespan on parallel machines subject to release dates and delivery times
cites work: Some simple scheduling algorithms
cites work: Q3217922
description: scientific article; zbMATH DE number 1903527