Complexity of Cyclic Job Shop Scheduling Problems for Identical Jobs with No-Wait Constraints

We consider the cyclic job shop problem with no-wait constraints which consists in minimizing the cycle time. We assume that a single product is produced on a few machines. A job is processed by performing a given set of operations in a predetermined sequence. Each operation can be performed on exac...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of applied and industrial mathematics Vol. 13; no. 4; pp. 706 - 716
Main Authors:	Romanova, A. A., Servakh, V. V.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.10.2019 Springer Nature B.V
Subjects:	Algorithms Complexity Cycle time Downtime Job shop scheduling Job shops Mathematics Mathematics and Statistics Polynomials Production scheduling pseudopolynomial algorithm cyclic job shop computational complexity theory scheduling theory polynomial algorithm identical jobs
ISSN:	1990-4789, 1990-4797
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!