The complexity of cyclic scheduling for identical jobs

MaRDI QIDQ5263822zbMATH OpenFDO

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

Publication date 17 July 2015

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

zbMATH Keywords

cyclic schedulingidentical tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cited in

(11)

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

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)