ON FINDING THE MOST VITAL JOB IN RELOCATION PROBLEM

DOI10.15807/JORSJ.37.182zbMath0823.90063OpenAlexW411212191MaRDI QIDQ4834041

Bertrand M. T. Lin

Publication date: 23 May 1995

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.37.182

zbMATH Keywords

relocation problemminimum resource requirementssingle machine without preemptions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: ON FINDING THE MOST VITAL JOB IN RELOCATION PROBLEM