A simpler and faster algorithm for optimal total-work-content-power due data determination

DOI10.1016/0895-7177(90)90373-UzbMath0691.90043MaRDI QIDQ583099

Steef L. van de Velde

Publication date: 1990

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

due date multiplier

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Optimal assignment of due-dates for preemptive single-machine scheduling

Cites Work

• Unnamed Item
• A Lagrangean dual-based solution method for a special linear programming problem
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Optimal total-work-content-power due-date determination and sequencing
• On Optimal Common Due-Date Determination

This page was built for publication: A simpler and faster algorithm for optimal total-work-content-power due data determination