The production-transportation problem of optimal plant location with startup priorities

MaRDI QIDQ1819692zbMATH OpenFDO

Authors N. D. Astakhov

Publication date 1986

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

combinatorial algorithmfacility locationoptimal startup sequenceplant locationsproduction and transportation costs

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Applications of mathematical programming (90C90)

Review text

We consider a problem in which the plant startups are specified by an ordered subset of a finite set of possible plant locations, and the objective function represents the production and transportation costs which are dependent on the startup sequence. The algorithm of successive computations solving the plant location problem is used to develop a combinatorial algorithm to find the optimal startup sequence.

Recommendations

• scientific article; zbMATH DE number 4068561
• On a general network location--production--allocation problem
• scientific article; zbMATH DE number 4010185
• scientific article; zbMATH DE number 4020810
• On the exact solution of large-scale simple plant location problems

This page was built for publication: The production-transportation problem of optimal plant location with startup priorities

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