Construction of cyclic schedules in presence of parallel machines

DOI10.1134/S1990478917010033zbMath1374.90151MaRDI QIDQ2984968

E. A. Bobrova, Vladimir V. Servakh

Publication date: 12 May 2017

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingcyclic schedulepseudopolynomial algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (2)

Estimation and optimization of the efficiency of a recursive conveyor ⋮ Minimizing the number of workers in a paced mixed-model assembly line

Cites Work

• The complexity of scheduling jobs in repetitive manufacturing systems
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• Some complexity results in cyclic scheduling
• The complexity of cyclic shop scheduling problems
• Cyclic Schedules for Job Shops with Identical Jobs
• Scheduling jobshops with some identical or similar jobs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of cyclic schedules in presence of parallel machines