Evolution based learning in a job shop scheduling environment

DOI10.1016/0305-0548(93)E0016-MzbMath0815.90089OpenAlexW2031409887MaRDI QIDQ1342315

Erwin Pesch, Ulrich Dorndorf

Publication date: 3 July 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(93)e0016-m

zbMATH Keywords

simulated annealingjob shop schedulinggenetic algorithmminimum makespan problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Genetics and epigenetics (92D10)

Related Items (35)

An improved shifting bottleneck procedure for the job shop scheduling problem ⋮ A novel threshold accepting meta-heuristic for the job-shop scheduling problem ⋮ Prototyped genetic search: a cybernetical approach to job‐shop scheduling problems ⋮ A very fast TS/SA algorithm for the job shop scheduling problem ⋮ A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling ⋮ Solving the job-shop scheduling problem optimally by dynamic programming ⋮ Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ A generalized permutation approach to job shop scheduling with genetic algorithms ⋮ Scatter search and star-paths: Beyond the genetic metaphor ⋮ A comparison of local search methods for flow shop scheduling ⋮ Metaheuristics: A bibliography ⋮ A new dispatching rule based genetic algorithm for the multi-objective job shop problem ⋮ A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach ⋮ An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling ⋮ RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions. ⋮ Transfer batch scheduling using genetic algorithms ⋮ Ant colony optimization combined with taboo search for the job shop scheduling problem ⋮ A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ A hybrid genetic algorithm for the job shop scheduling problem ⋮ An effective hybrid optimization strategy for job-shop scheduling problems ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ Using genetic algorithms (GA) and a coloured timed Petri net (CTPN) for modelling the optimization-based schedule generator of a generic production scheduling system ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ A genetic algorithm-based approach to machine assignment problem ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Hybrid rollout approaches for the job shop scheduling problem ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Measures of subproblem criticality in decomposition algorithms for shop scheduling ⋮ A new hybrid parallel genetic algorithm for the job‐shop scheduling problem ⋮ Distribution requirements and compactness constraints in school timetabling ⋮ The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling ⋮ A knowledge-based evolutionary strategy for scheduling problems with bottlenecks

Uses Software

• Genocop
• JOBSHOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical programming formulations for machine scheduling: A survey
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Evolution algorithms in combinatorial optimization
• A survey of priority rule-based scheduling
• The one-machine sequencing problem
• Genetic local search in combinatorial optimization
• A branch and bound algorithm for the job-shop scheduling problem
• Genetic algorithms: Foundations and applications
• Future paths for integer programming and links to artificial intelligence
• Applying tabu search to the job-shop scheduling problem
• A general search sequencing rule for job shop sequencing
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• Tabu Search—Part I
• Tabu Search—Part II
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• On general routing problems
• A Survey of Scheduling Rules
• Computational Complexity of Discrete Optimization Problems
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• A modified shifting bottleneck procedure for job-shop scheduling
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Algorithms for Solving Production-Scheduling Problems

This page was built for publication: Evolution based learning in a job shop scheduling environment