Optimal results and numerical simulations for flow shop scheduling problems

DOI10.1155/2012/395947zbMath1235.90066DBLPjournals/jam/RenDL12OpenAlexW2047019893WikidataQ58906832 ScholiaQ58906832MaRDI QIDQ410955

Tao Ren, Xiaochuan Luo, Yuandong Diao

Publication date: 4 April 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/395947

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Approximability of flow shop scheduling
• Schedule execution for two-machine flow-shop with interval processing times
• TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• New heuristics for flow shop problem to minimize makespan
• How good is a dense shop schedule?
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal results and numerical simulations for flow shop scheduling problems