Developing approaches to integrating manufacturing applications is important for increasing manufacturing productivity. A reactive scheduling system architecture has been developed that defines how to integrate scheduling technology with manufacturing shop floor applications. Prototype implementations based on this architecture have been built using a simulation of a shop floor instead of a rea...

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

This paper considers the complexity and the correlation of scheduling unit-time jobs on identical parallel machines and unit-time ow-shop scheduling under precedence constraints. It is shown that, in the case of chain-like precedence constraints, the nonpre-emptive parallel-machines problem and the ow-shop problem to minimize maximum or total completion time can be solved in polynomial time, an...

In flow shop scheduling there are m machines and n jobs, such that every job has to be processed on the machines in the fixed order 1, . . . , m. In the permutation flow shop problem, it is also required that each machine processes the set of all jobs in the same order. Formally, given n jobs along with their processing times on each machine, the goal is to compute a single permutation of the j...

Link utilization has received extensive attention since data centers become the most pervasive platform for data-parallel applications. A specific job of such applications involves communication among multiple machines. The recently proposed coflow abstraction depicts such communication through a group of parallel flows, and captures application performance through corresponding communication r...

When confronted by a problem, human designers often work forward from similar previously solved problems to solve the current problem. Based on this principle, we propose a new learning system especially suited for design using case-based reasoning principles to augment genetic algorithm search. When confronted with a problem we seed a genetic algorithm's initial population with solutions to si...

We investigate the problem of on-line scheduling two-machine open shops with the objective of minimizing the makespan. Jobs arrive independently over time, and the existence of a job is not known until its arrival. In the clairvoyant on-line model, the processing requirement of every job becomes fully known at the arrival of the job, while in the non-clairvoyant on-line model, this processing r...