THE LEXICO-BOUNDED FLOW ALGORITHM FOR SOLVING THE MINIMUM COST PROJECT SCHEDULING PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT

DOI10.15807/JORSJ.27.230zbMATH Open0555.90055OpenAlexW2729109596MaRDI QIDQ3220333

Takashi Kobayashi

Publication date: 1984

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.27.230

zbMATH Keywords

additional linear constraintlexico-shortest route algorithmminimum cost project scheduling problemparametrized right-hand side

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: THE LEXICO-BOUNDED FLOW ALGORITHM FOR SOLVING THE MINIMUM COST PROJECT SCHEDULING PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT

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