A Primal-dual Steepest-edge Method for Even-flow Harvest Scheduling Problems

DOI10.1111/1475-3995.00339zbMath0994.90073OpenAlexW1967521004MaRDI QIDQ4532542

Chiun-Ming Liu

Publication date: 10 October 2002

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00339

zbMATH Keywords

even-flow policy

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Uses Software

• C++ Builder

This page was built for publication: A Primal-dual Steepest-edge Method for Even-flow Harvest Scheduling Problems