Optimal time allocation for using a common machine

DOI10.1080/02522667.1997.10699349MaRDI QIDQ4239542zbMATH OpenOpenAlexFDO

Authors Teruhisa Nakai

Publication date 26 April 1999

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1997.10699349

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Other game-theoretic models (91A40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Application models in control theory (93C95)

Recommendations

• Optimal plan for using many common machines
• scientific article; zbMATH DE number 4089357
• On a Conjecture by Coffman, Flatto, and Wright on Stochastic Machine Minimization
• Cooperation in one machine scheduling

Cited in

(1)

• Optimal plan for using many common machines

This page was built for publication: Optimal time allocation for using a common machine

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