Abstract
This article discusses the One–Dimensional Space Allocation Problem (ODSAP) with the additional conditions. There are fixed objects (forbidden zones) and a partial order of placement objects on the line. You can not place objects in forbidden zones. The structure of connections between objects is determined using a directed graph. Situations of this type arise, for example, when designing the placement of technological equipment of some enterprise. Technological scheme of production determines the order of processing of raw materials. A polynomial–time algorithm for finding a local optimum for a special graph of connections between objects is proposed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
