z-logo
open-access-imgOpen Access
Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints
Author(s) -
А. А. Романова,
V. V. Servakh
Publication year - 2019
Publication title -
diskretnyi analiz i issledovanie operatsii
Language(s) - English
Resource type - Journals
ISSN - 1560-7542
DOI - 10.33048/daio.2019.26.629
Subject(s) - job shop , scheduling (production processes) , job shop scheduling , computer science , flow shop scheduling , operations research , mathematical optimization , mathematics , computer network , routing (electronic design automation)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom