The scheduling problem for pseudo-cyclic deliveries under window constraints is presented. The problem is formulated as a linear integer programming problem, where the objective function represented the minimization of the centralized supplier capacity needed to satisfy all user requests over a discretized planning horizon of infinite length. A heuristic algorithm running in polynomial time is illustrated and an experimental analysis of its efficiency is presented
A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints
PALETTA, Giuseppe
1987-01-01
Abstract
The scheduling problem for pseudo-cyclic deliveries under window constraints is presented. The problem is formulated as a linear integer programming problem, where the objective function represented the minimization of the centralized supplier capacity needed to satisfy all user requests over a discretized planning horizon of infinite length. A heuristic algorithm running in polynomial time is illustrated and an experimental analysis of its efficiency is presentedFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
