Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 6460055

From MaRDI portal
Publication:5263822
Jump to:navigation, search

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?)


zbMATH Keywords

cyclic schedulingidentical tasks


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5263822&oldid=19900769"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 20:16. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki