A New Bottleneck-Based Heuristic for Reentrant Job Shops: A Case Study in a Textile Factory
DOI10.1007/978-3-642-00142-0_26zbMATH Open1209.90251OpenAlexW149138513MaRDI QIDQ5392012FDOQ5392012
Seyda Topaloglu, Gamze Kilincli
Publication date: 7 April 2011
Published in: Operations Research Proceedings 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00142-0_26
Recommendations
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
- scientific article; zbMATH DE number 1271322
- Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Heuristic algorithms for two machine re-entrant flow shop
- A DBR scheduling method for manufacturing environments with bottleneck re-entrant flows
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- An improved shifting bottleneck procedure for the job shop scheduling problem
- On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Cited In (2)
This page was built for publication: A New Bottleneck-Based Heuristic for Reentrant Job Shops: A Case Study in a Textile Factory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5392012)
