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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of applied and industrial mathematics Jg. 13; H. 4; S. 706 - 716
Hauptverfasser: Romanova, A. A., Servakh, V. V.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Moscow Pleiades Publishing 01.10.2019
Springer Nature B.V
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 exactly one machine. We consider the problem of minimization the cycle time with no-wait constraints between some pairs of sequential operations and investigate the complexity of the problem and some of its subproblems. In general, the problem is proved to be strongly NP-hard. In the case when the job is processed without downtime between operations, polynomial solvability is proved and the two algorithms are proposed. Also we develop an algorithm for the general case which is pseudopolynomial if the number of admissible downtime is fixed. The case of a single no-wait constraint is polynomially solvable. The problem with two no-wait constraints becomes NP-hard. We found effectively solvable cases and propose the corresponding algorithms.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1990-4789
1990-4797
DOI:10.1134/S1990478919040136