Optimal results and numerical simulations for flow shop scheduling problems
From MaRDI portal
Publication:410955
DOI10.1155/2012/395947zbMath1235.90066WikidataQ58906832 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
65K05: Numerical mathematical programming methods
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
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