A fast method for heuristics in large-scale flow shop scheduling
From MaRDI portal
Publication:5477256
DOI10.1016/S1007-0214(06)70148-1zbMATH Open1274.90150OpenAlexW1966840747MaRDI QIDQ5477256FDOQ5477256
Authors: Cheng Wu, Xiaoping Li, Lian-Chen Liu 
Publication date: 30 June 2006
Full work available at URL: https://doi.org/10.1016/s1007-0214(06)70148-1
Recommendations
- A heuristic search algorithm for flow-shop scheduling
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic method for the flow shop sequencing problem
- A Note on Heuristics of Flow-Shop Scheduling
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- Heuristics for scheduling in a flow shop with multiple processors
- A new constructive heuristic for the flowshop scheduling problem
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A heuristic algorithm for Flow Shop problem in batch processing
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (8)
- A survey and evaluation of static flowshop scheduling heuristics
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Some efficient heuristic methods for the flow shop sequencing problem
- Shop scheduling in manufacturing environments: a review
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Fast parallel heuristics for the job shop scheduling problem
- Heuristics for scheduling in a flow shop with multiple processors
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
This page was built for publication: A fast method for heuristics in large-scale flow shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477256)
