An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
type: Item
instance of: scholarly article
title: An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
zbMATH Open document ID: 1052.90037
DOI: 10.1016/S0167-6377(03)00048-8
author: Yunpeng Pan
published in: Operations Research Letters
publication date: 2003-11-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2009204
zbMATH Keywords: Scheduling
zbMATH Keywords: Branch-and-bound
zbMATH Keywords: Bicriterion
zbMATH Keywords: Deadline
MaRDI profile type: Publication
cites work: Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
cites work: Scheduling to minimize the weighted sum of completion times with secondary criteria
cites work: A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
cites work: A note on a scheduling problem with dual criteria
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A note on the extension of a result on scheduling with secondary criteria
cites work: Q4055377
cites work: ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA
cites work: Minimizing Weighted Completion Times with Deadlines
cites work: An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
description: scientific article; zbMATH DE number 2009204