A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM WITH CONSIDERATION OF PRODUCT-DEPENDENT TRANSPORTATION

DOI10.15807/JORSJ.37.133MaRDI QIDQ4320150zbMATH OpenOpenAlexFDO

Authors Hirokazu Kono

Publication date 7 August 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.133

zbMATH Keywords

single machinetransportationmultiple productslot schedulingfinite planning periodcyclical production sequence

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• THE BALANCED LOT SIZE FOR A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM
• On multi-product lot-sizing and scheduling with multi-machine technologies
• Single machine multi-product capacitated lot sizing with sequence-dependent setups
• Multi-agent single machine scheduling problem with transportation constraints
• scientific article; zbMATH DE number 2156022
• scientific article; zbMATH DE number 4057282
• Fast computational procedure for solving multi-item single-machine lot scheduling optimzation problems
• Multi-item single source ordering problem with transportation cost: A Lagrangian decomposition approach
• scientific article; zbMATH DE number 6830874
• scientific article; zbMATH DE number 1100754

Cited in

(1)

• THE BALANCED LOT SIZE FOR A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM

This page was built for publication: A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM WITH CONSIDERATION OF PRODUCT-DEPENDENT TRANSPORTATION

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