Multi-machine Scheduling Problem Research Articles

A hybrid approach for real-time sequencing and scheduling

Abstract An approach for real-time sequencing and scheduling is described which integrates artificial neural networks, real-time simulation, genetic algorithms, and a trace-driven knowledge acquisition technique. This approach will be used to solve both single machine sequencing and multi-machine scheduling problems. Single-performance, artificial neural nets are used to quickly generate a small set of candidate sequencing or scheduling rules from some larger set of heuristics. A more detailed evaluation of these candidates is carried out using realtime simulation. This evaluation is necessary to generate a ranking that specifics how each rule performs against all of the performance measures. A further reduction of these candidates can be achieved from this ranking. Genetic algorithms are applied to this remaining set of rules to generate a single 'best' schedule. To capture the knowledge contained in that schedule, a trace-driven knowledge acquisition technique is used. Then, the derived rule is added to...

A backward approach in list scheduling algorithms for multi-machine tardiness problems

List scheduling algorithms are commonly used for multi-machine scheduling problems, especially for those with precedence relationships among operations. In most list scheduling algorithms, operations are scheduled forward. In this paper, we suggest a backward approach in which the operations are scheduled backward. We discuss some details that must be considered when applying the backward approach to problems with due dates and suggest several methods of defining parameters needed in the backward approach. Performance of this approach is tested on job shop problems and identical machine problems with several types of precedence constaints.

Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines

We present a polynomial time algorithm for constructing an optimal schedule, if a feasible schedule exists, for tthe following multimachine scheduling problem. There are n unit-time jobs, with arbitrary release times and deadlines, and m identical parallel machines. A feasible schedule is one in which no job is started before it is released, each job is completed by its deadline, and no job is interrupted once it begins to run.