Evolution based learning in a job shop scheduling environment

Fifty years of scheduling: a survey of milestones

“…The so-called bottleneck machine is the next machine to be selected, where the bottleneck machine is defined as the one having the largest objective function value among the solutions of these single machine problems. The shifting bottleneck approach can also be used within a local search framework by performing a search over the order in which the machines are selected for disjunctive edge orientation; for example, see the genetic algorithm of Dorndorf and Pesch (1995) and the guided local search method of Balas and Vazacopoulos (1998).…”

“…Storer et al (1992) use data perturbation and heuristic set representations in genetic algorithms, together with a hybrid representation. Other studies using a heuristic set representation include those of Smith (1992) and Dorndorf and Pesch (1995). Priority representations have also been proposed in which a solution is represented by a priority order of operations for each machine, with a schedule construction procedure used to create the corresponding solution.…”

Representations in Genetic Algorithm for the Job Shop Scheduling Problem: A Computational Study

“…In the priority rule-based (PR) representation [22], the chromosome is a string of priority dispatching rules which are applied in sequence to schedule operations within an active schedule generator, namely Giffler and Thompson algorithm [23]. Consequently, the chromosome length equals the total number of operations in a given problem.…”

Investigating parallel genetic algorithms on job shop scheduling problems

“…They defined a block as a sequence of successive operations on the critical path which are on the same machine with at least two operations. The reversal of a critical arc can only lead to an improvement if at least one of the reversed operations is either the first or the [15] perturbed processing time standard Dorndorf and Pesch (1993) [3] starting time standard Dorndorf and Pesch (1995) [4] priority rule standard Kobayashi et al (1995) [9] job order subsequence exchange Lin et al…”

“…Fig 3(a) shows an example in which each subpopulation on the ring is a torus. The frequency of migration on the ring is much smaller than that within the [20] 930 1178 Carlier and Pinson (1989) [21] 930 1165 Nakano and Yamada (1991) [14] 965 1215 Yamada and Nakano (1992) [18] 930 1184 Storer et al (1993) [15] 954 1180 Dorndorf and Pesch (1993) [3] 930 1165 Fang et al (1993) [5] 949 1189 Juels and Wattenberg (1994) [8] 937 1174 Mattfeld et al (1994) [12] 930 1165 Dorndorf and Pesch (1995) [4] 938 1178 Bierwirth (1995) [1] 936 1181 Kobayashi et al (1995) [9] 930 1173 Lin et al…”