A Global Constraint for Total Weighted Completion Time

DOI10.1007/978-3-540-72397-4_9MaRDI QIDQ3612411zbMATH OpenOpenAlexFDO

Authors András Kovács, J. Christopher Beck

Publication date 10 March 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72397-4_9

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A global constraint for total weighted completion time for unary resources
• Minimizing the sum of weighted completion times with unrestricted weights
• Approximability of total weighted completion time with resource consuming jobs
• Minimizing Weighted Completion Times with Deadlines
• Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
• The constrained minimum weighted sum of job completion times problem
• Integer Programming and Combinatorial Optimization
• A branch and bound algorithm for minimizing weighted completion times with deadlines
• The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic

Cited in

(4)

• LP-based online scheduling: From single to parallel machines
• A global constraint for total weighted completion time for unary resources
• scientific article; zbMATH DE number 2080320 (Why is no real title available?)
• Inequality-sum: a global constraint capturing the objective function

This page was built for publication: A Global Constraint for Total Weighted Completion Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612411)