An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion (Q4812724): Difference between revisions

Latest revision as of 20:30, 6 June 2024

scientific article; zbMATH DE number 2094338

Language	Label	Description	Also known as
English	An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion	scientific article; zbMATH DE number 2094338

Statements

instance of

scholarly article

0 references

title

An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion (English)

0 references

zbMATH Open document ID

1078.90537

0 references

DOI

10.1080/02522667.2002.10699531

0 references

published in

Journal of Information and Optimization Sciences

0 references

publication date

23 August 2004

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

minimum makespan criterion

0 references

author

Huey-Chin Tang

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02522667.2002.10699531

0 references

OpenAlex ID

W2046861767

0 references

cites work

A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem

0 references

A New Heuristic for Three-Machine Flow Shop Scheduling

0 references

Q4658190

0 references

The Lessons of Flowshop Scheduling Research

0 references

The Complexity of Flowshop and Jobshop Scheduling

0 references

Optimal two- and three-stage production schedules with setup times included

0 references

A General Bounding Scheme for the Permutation Flow-Shop Problem

0 references

An adaptive branching rule for the permutation flow-shop problem

0 references

Some results of the worst-case analysis for flow shop scheduling

0 references

A new lower bounding rule for permutation flow shop scheduling

0 references

A modification to the CGPS algorithm for three-machine flow shop scheduling

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4812724

@@ Property / author @@
-Huey-Chin Tang
@@ Property / author: Huey-Chin Tang / rank @@
-Normal rank
@@ Property / author @@
+Huey-Chin Tang
@@ Property / author: Huey-Chin Tang / rank @@
+Normal rank
@@ 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/02522667.2002.10699531
+Normal rank
@@ Property / OpenAlex ID @@
+W2046861767
@@ Property / OpenAlex ID: W2046861767 / rank @@
+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 @@
+A New Heuristic for Three-Machine Flow Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Q4658190
@@ Property / cites work: Q4658190 / rank @@
+Normal rank
@@ Property / cites work @@
+The Lessons of Flowshop Scheduling Research
@@ Property / cites work: The Lessons of Flowshop Scheduling Research / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+A General Bounding Scheme for the Permutation Flow-Shop Problem
+Normal rank
@@ Property / cites work @@
+An adaptive branching rule for the permutation flow-shop problem
+Normal rank
@@ Property / cites work @@
+Some results of the worst-case analysis for flow shop scheduling
+Normal rank
@@ Property / cites work @@
+A new lower bounding rule for permutation flow shop scheduling
+Normal rank
@@ Property / cites work @@
+A modification to the CGPS algorithm for three-machine flow shop scheduling
+Normal rank