New hard benchmark for flowshop scheduling problems minimising makespan (Q300036)

From MaRDI portal

Revision as of 05:58, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	New hard benchmark for flowshop scheduling problems minimising makespan	scientific article

Statements

scholarly article

0 references

New hard benchmark for flowshop scheduling problems minimising makespan (English)

0 references

0 references

0 references

Jose M. Framinan

0 references

European Journal of Operational Research

0 references

publication date

23 June 2016

0 references

full work available at URL

http://hdl.handle.net/10251/63119

0 references

zbMATH Keywords

flowshop

0 references

makespan

0 references

benchmark

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Ordonnancements à contraintes disjonctives

0 references

Benchmarks for shop scheduling problems

0 references

An improved NEH-based heuristic for the permutation flowshop problem

0 references

The Lessons of Flowshop Scheduling Research

0 references

A review and classification of heuristics for permutation flow-shop scheduling with makespan objective

0 references

The Complexity of Flowshop and Jobshop Scheduling

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Flowshop scheduling research after five decades

0 references

Flowshop-scheduling problems with makespan criterion: a review

0 references

Some Numerical Experiments for an <i>M</i> × <i>J</i> Flow Shop and its Decision-Theoretical Aspects

0 references

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

0 references

An improved NEH heuristic to minimize makespan in permutation flow shops

0 references

A computational study of the permutation flow shop problem based on a tight lower bound

0 references

0 references

A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime

0 references

Fifty years of scheduling: a survey of milestones

0 references

A genetic algorithm for flowshop sequencing

0 references

Search Methodologies

0 references

Landscapes, Embedded Paths and Evolutionary Scheduling

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

An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives

0 references

Benchmarks for basic scheduling problems

0 references

Shifting representation search for hybrid flexible flowline problems

0 references

Cooperative metaheuristics for the permutation flowshop scheduling problem

0 references

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

0 references

Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2014.07.033

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:300036

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q300036&oldid=36258869"