Email this article Construction of cyclic schedules in presence of parallel machines
- Authors: Bobrova E.A.1, Servakh V.V.1
-
Affiliations:
- Omsk Division of the Sobolev Institute of Mathematics
- Issue: Vol 11, No 1 (2017)
- Pages: 17-25
- Section: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212576
- DOI: https://doi.org/10.1134/S1990478917010033
- ID: 212576
Cite item
Open Access
Access granted
Subscription Access
Abstract
We consider the problem of processing some identical jobs with a complicated technological route on some production line in presence of parallel machines. Under some constrains on the number of jobs processed simultaneously, a cyclic schedule is desired with minimum cycle duration. Some algorithm for construction of an exact solution is proposed and substantiated. Also, we found the case of pseudopolynomially solvable problem.
About the authors
E. A. Bobrova
Omsk Division of the Sobolev Institute of Mathematics
Author for correspondence.
Email: eabobrova88@gmail.com
Russian Federation, ul. Pevtsova 13, Omsk, 644099
V. V. Servakh
Omsk Division of the Sobolev Institute of Mathematics
Email: eabobrova88@gmail.com
Russian Federation, ul. Pevtsova 13, Omsk, 644099
Supplementary files
