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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Naval research logistics Ročník 70; číslo 3; s. 274 - 283
Hlavní autor:	Shabtay, Dvir
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Hoboken, USA John Wiley & Sons, Inc 01.04.2023 Wiley Subscription Services, Inc
Témata:	distributed flow‐shop Factories hardness Just in time just‐in‐time scheduling pseudo‐polynomial time algorithm Scheduling
ISSN:	0894-069X, 1520-6750
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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 number of jobs completed in just‐in‐time mode is maximized. We classify computational complexity of the problems, including the special cases of unit weights and job‐ or machine‐independent processing times.
Bibliografie:	History Accepted by Marc Posner, project management and scheduling. ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	0894-069X 1520-6750
DOI:	10.1002/nav.22097