An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771): Difference between revisions

Latest revision as of 13:10, 8 July 2024

scientific article; zbMATH DE number 6295555

Language	Label	Description	Also known as
English	An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling	scientific article; zbMATH DE number 6295555

Statements

instance of

scholarly article

0 references

title

An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (English)

0 references

author

José Fernando Gonçalves

0 references

Mauricio G. C. Resende

0 references

published in

International Transactions in Operational Research

0 references

publication date

15 May 2014

0 references

full work available at URL

http://repositorio.inesctec.pt/handle/123456789/5392

0 references

zbMATH Keywords

job-shop

0 references

scheduling

0 references

genetic algorithm

0 references

biased random-key genetic algorithm

0 references

heuristics

0 references

random keys

0 references

graphical approach

0 references

describes a project that uses

JOBSHOP

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Computational Study of Local Search Algorithms for Job Shop Scheduling

0 references

The Shifting Bottleneck Procedure for Job Shop Scheduling

0 references

A Computational Study of the Job-Shop Scheduling Problem

0 references

Scheduling the General Job-Shop

0 references

Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

0 references

Genetic Algorithms and Random Keys for Sequencing and Optimization

0 references

A generalized permutation approach to job shop scheduling with genetic algorithms

0 references

The job shop scheduling problem: Conventional and new solution techniques

0 references

Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments

0 references

An efficient algorithm for the job-shop problem with two jobs

0 references

A branch and bound algorithm for the job-shop scheduling problem

0 references

An Algorithm for Solving the Job-Shop Problem

0 references

A practical use of Jackson's preemptive schedule for solving the job shop problem

0 references

A genetic algorithm for the job shop problem

0 references

A computational study of shifting bottleneck procedures for shop scheduling problems

0 references

Evolution based learning in a job shop scheduling environment

0 references

Q3938812

0 references

Algorithms for Solving Production-Scheduling Problems

0 references

A hybrid genetic algorithm for the job shop scheduling problem

0 references

Deterministic job-shop scheduling: Past, present and future

0 references

Job-Shop Scheduling by Implicit Enumeration

0 references

Computational Complexity of Discrete Optimization Problems

0 references

Job-shop scheduling: Computational study of local search and large-step optimization methods

0 references

A random key based genetic algorithm for the resource constrained project scheduling problem

0 references

A Fast Taboo Search Algorithm for the Job Shop Problem

0 references

An advanced tabu search algorithm for the job shop problem

0 references

An algorithm for the job shop scheduling problem based on global equilibrium search techniques

0 references

Solving job shop scheduling problems utilizing the properties of backbone and ``big valley''

0 references

A biased random-key genetic algorithm for the Steiner triple covering problem

0 references

Job shop scheduling with beam search

0 references

Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case

0 references

New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling

0 references

Parallel Taboo Search Techniques for the Job Shop Scheduling Problem

0 references

Job Shop Scheduling by Local Search

0 references

Job Shop Scheduling by Simulated Annealing

0 references

Q4848729

0 references

Short Shop Schedules

0 references

A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem

0 references

A very fast TS/SA algorithm for the job shop scheduling problem

0 references

Identifiers

zbMATH Open document ID

1291.90093

0 references

DOI

10.1111/itor.12044

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5416771

@@ Property / describes a project that uses @@
+JOBSHOP
@@ Property / describes a project that uses: JOBSHOP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2131113792
@@ Property / OpenAlex ID: W2131113792 / rank @@
+Normal rank
@@ Property / cites work @@
+A Computational Study of Local Search Algorithms for Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+The Shifting Bottleneck Procedure for Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+A Computational Study of the Job-Shop Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Scheduling the General Job-Shop
@@ Property / cites work: Scheduling the General Job-Shop / rank @@
+Normal rank
@@ Property / cites work @@
+Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Genetic Algorithms and Random Keys for Sequencing and Optimization
+Normal rank
@@ Property / cites work @@
+A generalized permutation approach to job shop scheduling with genetic algorithms
+Normal rank
@@ Property / cites work @@
+The job shop scheduling problem: Conventional and new solution techniques
+Normal rank
@@ Property / cites work @@
+Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the job-shop problem with two jobs
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the job-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for Solving the Job-Shop Problem
@@ Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A practical use of Jackson's preemptive schedule for solving the job shop problem
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the job shop problem
@@ Property / cites work: A genetic algorithm for the job shop problem / rank @@
+Normal rank
@@ Property / cites work @@
+A computational study of shifting bottleneck procedures for shop scheduling problems
+Normal rank
@@ Property / cites work @@
+Evolution based learning in a job shop scheduling environment
+Normal rank
@@ Property / cites work @@
+Q3938812
@@ Property / cites work: Q3938812 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Solving Production-Scheduling Problems
+Normal rank
@@ Property / cites work @@
+A hybrid genetic algorithm for the job shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Deterministic job-shop scheduling: Past, present and future
+Normal rank
@@ Property / cites work @@
+Job-Shop Scheduling by Implicit Enumeration
@@ Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Discrete Optimization Problems
+Normal rank
@@ Property / cites work @@
+Job-shop scheduling: Computational study of local search and large-step optimization methods
+Normal rank
@@ Property / cites work @@
+A random key based genetic algorithm for the resource constrained project scheduling problem
+Normal rank
@@ Property / cites work @@
+A Fast Taboo Search Algorithm for the Job Shop Problem
+Normal rank
@@ Property / cites work @@
+An advanced tabu search algorithm for the job shop problem
+Normal rank
@@ Property / cites work @@
+An algorithm for the job shop scheduling problem based on global equilibrium search techniques
+Normal rank
@@ Property / cites work @@
+Solving job shop scheduling problems utilizing the properties of backbone and ``big valley''
+Normal rank
@@ Property / cites work @@
+A biased random-key genetic algorithm for the Steiner triple covering problem
+Normal rank
@@ Property / cites work @@
+Job shop scheduling with beam search
@@ Property / cites work: Job shop scheduling with beam search / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
+Normal rank
@@ Property / cites work @@
+New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Job Shop Scheduling by Local Search
@@ Property / cites work: Job Shop Scheduling by Local Search / rank @@
+Normal rank
@@ Property / cites work @@
+Job Shop Scheduling by Simulated Annealing
@@ Property / cites work: Job Shop Scheduling by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4848729
@@ Property / cites work: Q4848729 / rank @@
+Normal rank
@@ Property / cites work @@
+Short Shop Schedules
@@ Property / cites work: Short Shop Schedules / rank @@
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
+Normal rank
@@ Property / cites work @@
+A very fast TS/SA algorithm for the job shop scheduling problem
+Normal rank