A genetic algorithm for the job shop problem
From MaRDI portal
Publication:1342314
DOI10.1016/0305-0548(93)E0015-LzbMath0816.90081MaRDI QIDQ1342314
Roberto Tadei, Giuseppe Volta, Frederico Della Croce
Publication date: 13 February 1995
Published in: Computers \& Operations Research (Search for Journal in Brave)
68T05: Learning and adaptive systems in artificial intelligence
90B35: Deterministic scheduling theory in operations research
92D10: Genetics and epigenetics
Related Items
Co-evolutionary genetic algorithm for multi-machine scheduling: Coping with high performance variability, A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling, A genetic algorithm-based approach to machine assignment problem, An effective hybrid optimization strategy for job-shop scheduling problems, Algorithmical approaches to business process design, A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan, A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, FMS scheduling based on timed Petri net model and reactive graph search, Scheduling coordination problems in supply chain planning, Ant colony optimization combined with taboo search for the job shop scheduling problem, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm, A genetic algorithm for the proportionate multiprocessor open shop, Hybrid rollout approaches for the job shop scheduling problem, The job shop scheduling problem: Conventional and new solution techniques, A genetic algorithm for multi-mode resource constrained project scheduling problem, RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions., The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure., An efficient genetic algorithm for job shop scheduling with tardiness objectives., Deterministic job-shop scheduling: Past, present and future, Job-shop scheduling with blocking and no-wait constraints, A novel threshold accepting meta-heuristic for the job-shop scheduling problem, A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility, A comparison of local search methods for flow shop scheduling, Metaheuristics: A bibliography, A very fast TS/SA algorithm for the job shop scheduling problem, A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem, A prediction based iterative decomposition algorithm for scheduling large-scale job shops, A hybrid genetic algorithm for the job shop scheduling problem, A multiobjective evolutionary algorithm for scheduling and inspection planning in software development projects, Modelling and heuristics of FMS scheduling with multiple objectives, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
Uses Software
Cites Work
- Applying tabu search to the job-shop scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
