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

DOI10.1016/0895-7177(90)90373-UMaRDI QIDQ583099zbMATH OpenFDO

Authors Steef 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)

Recommendations

• On Optimal Common Due-Date Determination
• Optimal total-work-content-power due-date determination and sequencing
• An algorithm for the CON due-date determination and sequencing problem
• A faster algorithm for a due date assignment problem with tardy jobs
• Optimal assignment of due-dates for preemptive single-machine scheduling

Cites work

• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• 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
• On Optimal Common Due-Date Determination
• Optimal total-work-content-power due-date determination and sequencing

Cited in

(3)

• A faster algorithm for a due date assignment problem with tardy jobs
• Optimal total-work-content-power due-date determination and sequencing
• Optimal assignment of due-dates for preemptive single-machine scheduling

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

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