An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences
- 33 Downloads
We describe an integer-valued model of the total service time minimization problem for a partially ordered set of claims with identical servicing times, serviced in parallel by identical devices. We construct a target function over the polyhedron corresponding to the problem. We give results of a numerical experiment that deal with the variance of the total service time and the structure of the schedules’ convex hull.
KeywordsRemote Control Target Function Maximal Path Integer Linear Programming Problem Parallel Machine Schedule Problem
Unable to display preview. Download preview PDF.
- 2.Tanaev, V.S., Gordon, V.S., and Shafransky, Ya.M., Teoriya raspisanii. Odnostadiinye sistemy (Scheduling Theory. Single-stage Systems), Moscow: Nauka, 1984.Google Scholar
- 4.Simanchev, R.Yu. and Urazova, I.V., A Class of Support Inequalities for the Schedule Polytope for Servicing Unit Claims with Parallel Processors, in Matematicheskoe programmirovanie, Tr. XIV Baikal’skoi mezhdunar. shk.-seminara “Metody optimizatsii i ikh prilozheniya” (Mathematical Programming. Proc. of the XIV Baikal International School-seminar “Optimization Methods and Their Applications”), Irkutsk: ISEM SO RAN, 2008, vol. 1, pp. 530–536Google Scholar
- 7.Project Scheduling. Recent Models, Algorithms and Applications, Weglars, J., Ed., Boston: Kluwer, 1999.Google Scholar