Enviar artigo por via de e-mail Construction of cyclic schedules in presence of parallel machines
- Autores: Bobrova E.1, Servakh V.1
-
Afiliações:
- Omsk Division of the Sobolev Institute of Mathematics
- Edição: Volume 11, Nº 1 (2017)
- Páginas: 17-25
- Seção: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212576
- DOI: https://doi.org/10.1134/S1990478917010033
- ID: 212576
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Palavras-chave
Sobre autores
E. Bobrova
Omsk Division of the Sobolev Institute of Mathematics
Autor responsável pela correspondência
Email: eabobrova88@gmail.com
Rússia, ul. Pevtsova 13, Omsk, 644099
V. Servakh
Omsk Division of the Sobolev Institute of Mathematics
Email: eabobrova88@gmail.com
Rússia, ul. Pevtsova 13, Omsk, 644099
