Minimizing the sum of weighted completion times with unrestricted weights

DOI10.1016/0166-218X(94)00028-CzbMath0837.90065WikidataQ59222316 ScholiaQ59222316MaRDI QIDQ1902889

Mauro Dell'Amico, Daniele Vigo, Silvano Martello

Publication date: 3 December 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

weightsdynamic programmingearlinessbranch-and-boundlower bounddeadlinessum of weighted completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
• Single machine scheduling with flow time and earliness penalties
• A GRASP for a difficult single machine scheduling problem
• Scheduling with release dates on a single machine to minimize total weighted completion time
• Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
• A Dynamic Programming Approach to Sequencing Problems
• Minimizing Weighted Completion Times with Deadlines
• Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey