作者: S. Ahmad Hosseini , Eddie Wadbro
DOI: 10.1080/10556788.2015.1121484
关键词:
摘要: Time-dependent multi-item problems arise frequently in management applications, communication systems, and production–distribution systems. Our problem belongs to the last category, where we wish address feasibility of such systems when all network parameters change over time product. The objective is determine whether it possible have a dynamic production–shipment circuit within finite planning horizon. And, if there no flow, goal infeasibility occurs approximate magnitude infeasibility. This information may help decision maker their efforts resolve system. discrete-time settings investigated hybrid scaling approach penalty function method together with optimality condition utilized develop network-based algorithm. algorithm analysed from theoretical practical perspectives by means instances corresponding some electricity transmission-distribution networks many random instances. Computational results illustrate performance