Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
研究了由多个并行工厂组成的分布式流水车间调度问题，目标是最大化准时制完工的加权作业数量，并分析了不同情形下的计算复杂性。
Abstract 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.