One-machine job-scheduling with non-constant capacity -- minimizing weighted completion times

DOI10.1016/S0377-2217(96)00240-8zbMath0951.90556MaRDI QIDQ1291626

K. Appert

Publication date: 17 December 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

one-machine schedulingweighted completion timesnon-constant capacity

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Optimality conditions and duality in mathematical programming (90C46) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A unified view of parallel machine scheduling with interdependent processing rates

Cites Work

• Unnamed Item
• Sequencing independent jobs with a single resource

This page was built for publication: One-machine job-scheduling with non-constant capacity -- minimizing weighted completion times