A simpler and faster algorithm for optimal total-work-content-power due data determination
From MaRDI portal
Publication:583099
DOI10.1016/0895-7177(90)90373-UzbMath0691.90043MaRDI QIDQ583099
Publication date: 1990
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
Related Items
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