Optimal servicing strategy design problems for stationary objects in a one-dimensional working zone of a processor

Kogan, D. I.; Fedosenko, Yu. S.

doi:10.1134/s000511791010005x

Cited by 7 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For many logistics tasks, for example, planning and control in transportation systems, the problem size n can be significantly higher. However, due to technical circumstances a regular time-limit θ for synthesis of the schedule p* is defined as a value of same order n [4]. Therefore, the effective solution methods and special computing architectures are required to provide fast computation of dispatching tasks under time-limit constrain.…”

Section: Mathematical Modelmentioning

confidence: 99%

Scaling analysis of solving algorithms for canonical problem of dispatching in the context of dynamic programming

Fedosenko

Reznikov

Plekhov

et al. 2017

2017 Internet Technologies and Applications (ITA)

View full text Add to dashboard Cite

The paper analyses computational model based on dynamic programming for platforms with multicore processors and heterogeneous architectures with FPGA. The models are applied for solving a canonical problem of dispatching where the computation time significantly depends on the problem scale factor. The parallel algorithms of NP-hard problem of dispatching are complicate and require intensive RAM data exchange. In order to reduce the computation time, it is suggested to use FPGA as a coprocessor providing massively parallel computation and increase the operational performance of the system in one order.

show abstract

Section: Mathematical Modelmentioning

confidence: 99%

Scaling analysis of solving algorithms for canonical problem of dispatching in the context of dynamic programming

Fedosenko

Reznikov

Plekhov

et al. 2017

2017 Internet Technologies and Applications (ITA)

View full text Add to dashboard Cite

show abstract

“…It is known [21], that if all ready dates r j are equal to zero and the individual penalty functions ϕ j (t) are linear, j = 1, n, then problem 3 has polynomial solution. However, one cannot avoid the fact as follows.…”

Section: Computational Complexity Of the Problemmentioning

confidence: 99%

“…According to (21), the single efficient estimate in the considered example is (41, 32); thus, there has been defined an optimal strategy for both criteria considered here. The estimate indices that have been entered in Table 2 allow easy finding the strategy, which generates the estimate: objects 1, 3, 4 to be served in the direct voyage; object 2 to be served in the return voyage.…”

Section: Problem 2 Solving Algorithmmentioning

confidence: 99%

Scheduling Problems of Stationary Objects With the Processor in One-Dimensional Zone

Дуничкина¹,

Kogan²,

Федосенко³

2015

Model. anal. inf. sist.

Self Cite

View full text Add to dashboard Cite

We consider the mathematical model in which an operating processor serves the set of the stationary objects positioned in a one-dimensional working zone. The processor performs two voyages between the uttermost points of the zone: the forward or direct one, where certain objects are served, and the return one, where remaining objects are served. Servicing of the object cannot start earlier than its ready date. The individual penalty function is assigned to every object, the function depending on the servicing completion time. Minimized criteria of schedule quality are assumed to be total service duration and total penalty. We formulate and study optimization problems with one and two criteria. Proposed algorithms are based on dynamic programming and Pareto principle, the implementations of these algorithms are demonstrated on numerical examples. We show that the algorithm for the problem of processing time minimization is polynomial, and that the problem of total penalty minimization is N P -hard. Correspondingly, the bicriteria problem with the mentioned evaluation criteria is fundamentally intractable, computational complexity of the schedule structure algorithm is exponential. The model describes the fuel supply processes to the diesel-electrical dredgers which extract non-metallic building materials (sand, gravel) in large-scale areas of inland waterways. Similar models and optimization problems are important, for example, in applications like the control of satellite group refueling and regular civil aircraft refueling.The article is published in the author's wording.

show abstract

A Model of FPGA Massively Parallel Calculations for Hard Problem of Scheduling in Transportation Systems

Reznikov

Fedosenko

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Optimal servicing strategy design problems for stationary objects in a one-dimensional working zone of a processor

Cited by 7 publications

References 3 publications

Scaling analysis of solving algorithms for canonical problem of dispatching in the context of dynamic programming

Scaling analysis of solving algorithms for canonical problem of dispatching in the context of dynamic programming

Scheduling Problems of Stationary Objects With the Processor in One-Dimensional Zone

A Model of FPGA Massively Parallel Calculations for Hard Problem of Scheduling in Transportation Systems

Contact Info

Product

Resources

About