Service schedule synthesis for the packet stream of identical objects
The article considers the model of a single-stage servicing by stationary processor of deterministic stream of objects coming in packets. The packet is considered to be served if service is completed for all of its constituent objects. Each packet has an associated linear penalty function from the moment of its service completion. All the objects that make up the package are considered to be identical. The author sets the problems of service schedule synthesis, constructs solving algorithms based on dynamic programming and branch and bound ideology. Sample implementations of solving algorithms are offered.