Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study (Q4671306): Difference between revisions

Latest revision as of 10:31, 10 June 2024

scientific article; zbMATH DE number 2161405

Language	Label	Description	Also known as
English	Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study	scientific article; zbMATH DE number 2161405

Statements

instance of

scholarly article

0 references

title

Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study (English)

0 references

zbMATH Open document ID

1060.90654

0 references

DOI

10.1080/00207540410001699381

0 references

published in

International Journal of Production Research

0 references

publication date

26 April 2005

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/00207540410001699381

0 references

OpenAlex ID

W2170876038

0 references

cites work

Design and implementation of a course scheduling system using Tabu Search

0 references

A tabu search approach for the flow shop scheduling problem

0 references

A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

0 references

Comparison of iterative improvement techniques for schedule optimization

0 references

Tabu Search—Part I

0 references

Genetic algorithms and tabu search: Hybrids for optimization

0 references

Two-Stage, Hybrid Flowshop Scheduling Problem

0 references

A dynamic tabu search for large-scale generalized assignment problems

0 references

Local search algorithms for the multiprocessor flow shop scheduling problem

0 references

Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution

0 references

A simple tabu search method to solve the mixed-integer linear bilevel programming problem

0 references

A new heuristic method for the flow shop sequencing problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4671306

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207540410001699381
+Normal rank
@@ Property / OpenAlex ID @@
+W2170876038
@@ Property / OpenAlex ID: W2170876038 / rank @@
+Normal rank
@@ Property / cites work @@
+Design and implementation of a course scheduling system using Tabu Search
+Normal rank
@@ Property / cites work @@
+A tabu search approach for the flow shop scheduling problem
+Normal rank
@@ Property / cites work @@
+A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem
+Normal rank
@@ Property / cites work @@
+Comparison of iterative improvement techniques for schedule optimization
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part I
@@ Property / cites work: Tabu Search—Part I / rank @@
+Normal rank
@@ Property / cites work @@
+Genetic algorithms and tabu search: Hybrids for optimization
+Normal rank
@@ Property / cites work @@
+Two-Stage, Hybrid Flowshop Scheduling Problem
@@ Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A dynamic tabu search for large-scale generalized assignment problems
+Normal rank
@@ Property / cites work @@
+Local search algorithms for the multiprocessor flow shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Note—Sequencing <i>n</i> Jobs on <i>m</i> Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
+Normal rank
@@ Property / cites work @@
+A simple tabu search method to solve the mixed-integer linear bilevel programming problem
+Normal rank
@@ Property / cites work @@
+A new heuristic method for the flow shop sequencing problem
+Normal rank