Photo from archive.org
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… Click to show full 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.
Keywords:
cyclic schedules;
parallel machines;
construction cyclic;
presence parallel
Journal Title: Journal of Applied and Industrial Mathematics
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Applied and Industrial Mathematics
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!