Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system-Reference-Cited by-同舟云学术

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

Published:2023-01-09 Issue:3 Volume:70 Page:274-283
ISSN:0894-069X
Container-title:Naval Research Logistics (NRL)
language:en
Short-container-title:Naval Research Logistics

Author:

Shabtay Dvir¹^ORCID

Affiliation:

1. Department of Industrial Engineering and Management Ben‐Gurion University of the Negev Beer‐Sheva Israel

Abstract

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

Publisher

Wiley

Subject

Management Science and Operations Research,Ocean Engineering,Modeling and Simulation

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/nav.22097

Reference36 articles.

1. Distributed permutation flowshop scheduling problem with total completion time objective

2. Scheduling jobs with fixed start and end times

3. Sequencing with Earliness and Tardiness Penalties: A Review

4. Optimisation approaches for distributed scheduling problems

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Self-Adaptive Population-Based Iterated Greedy Algorithm for Distributed Permutation Flowshop Scheduling Problem with Part of Jobs Subject to a Common Deadline Constraint;Expert Systems with Applications;2024-08