Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system

We study a set of scheduling problems in a distributed flow‐shop scheduling system consisting of several flow‐shop production systems (factories) working in parallel. Our objective is to assign the jobs to the factories, and to devise a job schedule for each of the factories such that the weighted n...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Naval research logistics Jg. 70; H. 3; S. 274 - 283
1. Verfasser:	Shabtay, Dvir
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken, USA John Wiley & Sons, Inc 01.04.2023 Wiley Subscription Services, Inc
Schlagworte:	distributed flow‐shop Factories hardness Just in time just‐in‐time scheduling pseudo‐polynomial time algorithm Scheduling
ISSN:	0894-069X, 1520-6750
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!