Lower bounds for parallel machine scheduling problems
type: Item
instance of: scholarly article
title: Lower bounds for parallel machine scheduling problems
zbMATH Open document ID: 1144.90376
DOI: 10.1504/IJOR.2008.019731
author: Philippe Baptiste
author: Antoine Jouglet
author: David Savourey
published in: International Journal of Operational Research
publication date: 2008-10-02T00:00:00Z
review text: Summary: We study the parallel machine scheduling problem with release dates and consider several `min-sum' objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to their quality and of their computational time requirement.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5348783
zbMATH Keywords: identical parallel machines
zbMATH Keywords: lower bounds
zbMATH Keywords: parallel machine scheduling
zbMATH Keywords: total cost
zbMATH Keywords: release dates
MaRDI profile type: Publication
full work available at URL: ijor.2008.019731
OpenAlex ID: W2107539660
description: scientific article; zbMATH DE number 5348783