Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073): Difference between revisions

Latest revision as of 00:10, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness	scientific article

Statements

instance of

scholarly article

0 references

title

Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (English)

0 references

author

Victor Fernandez-Viagas

0 references

Jose M. Framinan

0 references

published in

Computers \& Operations Research

0 references

publication date

17 November 2016

0 references

zbMATH Keywords

scheduling

0 references

flowshop

0 references

heuristics

0 references

neh

0 references

pfsp

0 references

maximum tardiness

0 references

makespan

0 references

bounded insertion

0 references

non-population algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2015.05.006

0 references

cites work

Q3970631

0 references

Benchmarks for shop scheduling problems

0 references

NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness

0 references

A new set of high-performing heuristics to minimise flowtime in permutation flowshops

0 references

On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem

0 references

Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm

0 references

Manufacturing Scheduling Systems

0 references

Q4187195

0 references

Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness

0 references

A comprehensive review and evaluation of permutation flowshop heuristics

0 references

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

0 references

Some efficient heuristic methods for the flow shop sequencing problem

0 references

Benchmarks for basic scheduling problems

0 references

Q3378953

0 references

Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

0 references

Identifiers

zbMATH Open document ID

1349.90345

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.COR.2015.05.006

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:342073

@@ Property / DOI @@
-.1016/j.cor.2015.05.006
@@ Property / DOI: 10.1016/j.cor.2015.05.006 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6654041
@@ Property / zbMATH DE Number: 6654041 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+flowshop
@@ Property / zbMATH Keywords: flowshop / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+heuristics
@@ Property / zbMATH Keywords: heuristics / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+neh
@@ Property / zbMATH Keywords: neh / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+pfsp
@@ Property / zbMATH Keywords: pfsp / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximum tardiness
@@ Property / zbMATH Keywords: maximum tardiness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+makespan
@@ Property / zbMATH Keywords: makespan / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bounded insertion
@@ Property / zbMATH Keywords: bounded insertion / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+non-population algorithm
@@ Property / zbMATH Keywords: non-population algorithm / 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.1016/j.cor.2015.05.006
+Normal rank
@@ Property / OpenAlex ID @@
+W353205918
@@ Property / OpenAlex ID: W353205918 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3970631
@@ Property / cites work: Q3970631 / rank @@
+Normal rank
@@ Property / cites work @@
+Benchmarks for shop scheduling problems
@@ Property / cites work: Benchmarks for shop scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
+Normal rank
@@ Property / cites work @@
+A new set of high-performing heuristics to minimise flowtime in permutation flowshops
+Normal rank
@@ Property / cites work @@
+On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
+Normal rank
@@ Property / cites work @@
+Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
+Normal rank
@@ Property / cites work @@
+Manufacturing Scheduling Systems
@@ Property / cites work: Manufacturing Scheduling Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4187195
@@ Property / cites work: Q4187195 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
+Normal rank
@@ Property / cites work @@
+A comprehensive review and evaluation of permutation flowshop heuristics
+Normal rank
@@ Property / cites work @@
+A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
+Normal rank
@@ Property / cites work @@
+Some efficient heuristic methods for the flow shop sequencing problem
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3378953
@@ Property / cites work: Q3378953 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2015.05.006
@@ Property / DOI: 10.1016/J.COR.2015.05.006 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:342073