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

Full description

Saved in:

Bibliographic Details
Published in:	Naval research logistics Vol. 70; no. 3; pp. 274 - 283
Main Author:	Shabtay, Dvir
Format:	Journal Article
Language:	English
Published:	Hoboken, USA John Wiley & Sons, Inc 01.04.2023 Wiley Subscription Services, Inc
Subjects:	distributed flow‐shop Factories hardness Just in time just‐in‐time scheduling pseudo‐polynomial time algorithm Scheduling
ISSN:	0894-069X, 1520-6750
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	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