Algorithmic research on the supply chain scheduling problem with optional path and transportation mode

DOI10.3969/J.ISSN.1674-5043.2012.01.015MaRDI QIDQ4901809zbMATH OpenFDO

Authors Bei Zhang, Hui Chang

Publication date 24 January 2013

zbMATH Keywords

distributionschedulingsupply chainbatchingpolynomial time algorithm

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Recommendations

• The supply chain scheduling problem with transportation and batching
• Research on supply chain scheduling based on multiple attribute decision-making
• scientific article; zbMATH DE number 5773643
• Algorithms for supply chain scheduling problems with batch-processing machines and arbitrary-size jobs
• Supply chain scheduling with parallel machines

Cited in

(6)

• Research on supply chain scheduling based on multiple attribute decision-making
• Integrated supply chain scheduling of procurement, production, and distribution under spillover effects
• Algorithm for constructing a delivery-sequencing/inventory-allocation plan for supply chain control in the operational planning level
• Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design
• The supply chain scheduling problem with transportation and batching
• A multi-objective and integrated model for supply chain scheduling optimization in a multi-site manufacturing system

This page was built for publication: Algorithmic research on the supply chain scheduling problem with optional path and transportation mode

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