Irreducible bin packing and normality in routing open shop

The open shop is a classical scheduling problem known since 1976, which can be described as follows. A number of jobs have to be processed by a given set of machines, each machine should perform an operation on every job, and the processing times of all the operations are given. One has to construct...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of mathematics and artificial intelligence 2021-09, Vol.89 (8-9), p.899-918
Hauptverfasser:	Chernykh, Ilya, Pyatkin, Artem
Format:	Artikel
Sprache:	eng
Schlagworte:	Artificial Intelligence Complex Systems Computer Science Lower bounds Management science Mathematics Schedules Scheduling Transportation networks Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!