Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A New Heuristic Method for the Permutation Flow Shop Scheduling Problem

From MaRDI portal
Publication:4849303
Jump to:navigation, search

DOI10.1057/jors.1995.119zbMath0832.90057OpenAlexW2123411720MaRDI QIDQ4849303

João Vitor Moccellin

Publication date: 5 March 1996

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1995.119


zbMATH Keywords

tabu searchsequencingheuristictravelling salesmanpermutation flow shop scheduling


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items (5)

Metaheuristics: A bibliography ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues







This page was built for publication: A New Heuristic Method for the Permutation Flow Shop Scheduling Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4849303&oldid=19194714"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 03:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki