A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q5431617): Difference between revisions

Latest revision as of 13:07, 27 June 2024

scientific article; zbMATH DE number 5219656

Language	Label	Description	Also known as
English	A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness	scientific article; zbMATH DE number 5219656

Statements

instance of

scholarly article

0 references

title

A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (English)

0 references

0 references

0 references

0 references

International Journal of Computer Mathematics

0 references

publication date

12 December 2007

0 references

zbMATH Keywords

flow shop

0 references

makespan

0 references

GRASP algorithm

0 references

metaheuristic

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/00207160701331376

0 references

cites work

Multiple and bicriteria scheduling: A literature survey

0 references

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

0 references

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

0 references

Minimizing total tardiness in permutation flowshops

0 references

Q3970631

0 references

The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

0 references

Greedy randomized adaptive search procedures

0 references

Q2776548

0 references

A greedy randomized adaptive search procedure for the feedback vertex set problem

0 references

Semi-greedy heuristics: An empirical study

0 references

A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs

0 references

Benchmarks for basic scheduling problems

0 references

Identifiers

zbMATH Open document ID

1134.90385

0 references

DOI

10.1080/00207160701331376

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5431617

@@ 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/00207160701331376
+Normal rank
@@ Property / OpenAlex ID @@
+W2022297072
@@ Property / OpenAlex ID: W2022297072 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple and bicriteria scheduling: A literature survey
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+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 @@
+Minimizing total tardiness in permutation flowshops
+Normal rank
@@ Property / cites work @@
+Q3970631
@@ Property / cites work: Q3970631 / rank @@
+Normal rank
@@ Property / cites work @@
+The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
+Normal rank
@@ Property / cites work @@
+Greedy randomized adaptive search procedures
@@ Property / cites work: Greedy randomized adaptive search procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q2776548
@@ Property / cites work: Q2776548 / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy randomized adaptive search procedure for the feedback vertex set problem
+Normal rank
@@ Property / cites work @@
+Semi-greedy heuristics: An empirical study
@@ Property / cites work: Semi-greedy heuristics: An empirical study / rank @@
+Normal rank
@@ Property / cites work @@
+A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank