𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Frameworks for adaptable scheduling algorithms

✍ Scribed by Scott Webster

Publisher
Springer US
Year
2000
Tongue
English
Weight
216 KB
Volume
3
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

✦ Synopsis

This paper considers the design of adaptable algorithms that aid the planning and control of material #ow through a factory, distribution network, or supply chain. The purpose is to add to the discussion of a research area that, due to technological developments, has the potential to signi"cantly impact practice. We present an overview of the literature on this subject and describe two frameworks that support adaptable scheduling algorithms. One framework builds on insights while the other exploits computing power. General approaches for developing each framework are proposed and illustrated.

πŸ“œ SIMILAR VOLUMES

Class scheduling algorithms for Navy tra
Class scheduling algorithms for Navy training schools
✍ A. Apte; A. Jayasuriya; J. Kennington; I. Krass; R. Mohamed; S. Sorensen; J. Whi πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 153 KB

The problem of developing good schedules for Navy C-Schools has been modeled as a combinatorial optimization problem. The only complicating feature of the problem is that classes must be grouped together into sequences known as pipelines. An ideal schedule will have all classes in a pipeline schedul

Heuristic and exact algorithms for sched
Heuristic and exact algorithms for scheduling aircraft landings
✍ Ernst, Andreas T.; Krishnamoorthy, Mohan; Storer, Robert H. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 116 KB

The problem of scheduling aircraft landings on one or more runways is an interesting problem that is similar to a machine job scheduling problem with sequence-dependent processing times and with earliness and tardiness penalties. The aim is to optimally land a set of planes on one or several runways

Project scheduling using a genetic algor
Project scheduling using a genetic algorithm with adaptable changing genetic operators
✍ Tomoya Ikeuchi; Yoshitomo Ikkai; Dai Araki; Takenao Ohkawa; Norihisa Komoda πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 252 KB πŸ‘ 2 views

Genetic algorithms (GA) have been widely used to solve planning problems. However, they require one to determine the optimal values of many genetic parameters, such as population sizes, crossover probability, mutation probability, and so on. To make matters worse, the most suitable combination of pa

Adaptive notification framework for conv
Adaptive notification framework for converged environments
✍ Robert M. Arlein; StΓ©phane BetgΓ©-Brezetz; J. Robert Ensor πŸ“‚ Article πŸ“… 2008 πŸ› Institute of Electrical and Electronics Engineers 🌐 English βš– 158 KB πŸ‘ 1 views
A genetic algorithm methodology for comp
A genetic algorithm methodology for complex scheduling problems
✍ Bryan A. Norman; James C. Bean πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 79 KB πŸ‘ 2 views

This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration ty