scientific article; zbMATH DE number 6460055
From MaRDI portal
Publication:5263822
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
Title of this publication is not available (Why is that?)
Cited In (8)
- 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
- Construction of cyclic schedules in presence of parallel machines
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263822)