The complexity of cyclic scheduling for identical jobs

zbMATH Open1324.90052MaRDI QIDQ5263822FDOQ5263822

Anna A. Romanova, E. A. Bobrova, V. V. Servakh

Publication date: 17 July 2015

Full work available at URL: http://mathnet.ru/eng/da735

Recommendations

• Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints
• The complexity of cyclic shop scheduling problems
• Chromatic scheduling in a cyclic open shop
• The complexity of a cyclic scheduling problem with identical machines and precedence constraints
• Some complexity results in cyclic scheduling

zbMATH Keywords

cyclic schedulingidentical tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (10)

• On Graham's bound for cyclic scheduling
• Cyclic Schedules for Job Shops with Identical Jobs
• Makespan minimization in reentrant flow shop problem with identical jobs
• Two job cyclic scheduling with incompatibility constraints
• Chromatic scheduling in a cyclic open shop
• Construction of cyclic schedules in presence of parallel machines
• High-multiplicity cyclic job shop scheduling
• The complexity of cyclic shop scheduling problems
• Some complexity results in cyclic scheduling
• Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints

This page was built for publication: The complexity of cyclic scheduling for identical jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263822)