Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s10951-020-00637-8
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
- Georgios Saharidis & Marianthi Ierapetritou, 2013. "Speed-up Benders decomposition using maximum density cut (MDC) generation," Annals of Operations Research, Springer, vol. 210(1), pages 101-123, November.
- T. L. Magnanti & R. T. Wong, 1981. "Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria," Operations Research, INFORMS, vol. 29(3), pages 464-484, June.
- I. Adiri & D. Pohoryles, 1982. "Flowshop/no‐idle or no‐wait scheduling to minimize the sum of completion times," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 29(3), pages 495-504, September.
- Jean-François Cordeau & Federico Pasin & Marius Solomon, 2006. "An integrated model for logistics network design," Annals of Operations Research, Springer, vol. 144(1), pages 59-82, April.
- Quan-Ke Pan & Ling Wang, 2008. "A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 2(3), pages 279-297.
- Goncharov, Yaroslav & Sevastyanov, Sergey, 2009. "The flow shop problem with no-idle constraints: A review and approximation," European Journal of Operational Research, Elsevier, vol. 196(2), pages 450-456, July.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Chen-Yang Cheng & Shih-Wei Lin & Pourya Pourhejazy & Kuo-Ching Ying & Yu-Zhe Lin, 2021. "No-Idle Flowshop Scheduling for Energy-Efficient Production: An Improved Optimization Framework," Mathematics, MDPI, vol. 9(12), pages 1-18, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
- M. Jenabi & S. Fatemi Ghomi & S. Torabi & S. Hosseinian, 2015. "Acceleration strategies of Benders decomposition for the security constraints power system expansion planning," Annals of Operations Research, Springer, vol. 235(1), pages 337-369, December.
- Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.
- Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric & Van Woensel, Tom, 2020. "A Benders decomposition-based approach for logistics service network design," European Journal of Operational Research, Elsevier, vol. 286(2), pages 523-537.
- Zewen Sun & Xingsheng Gu, 2017. "Hybrid Algorithm Based on an Estimation of Distribution Algorithm and Cuckoo Search for the No Idle Permutation Flow Shop Scheduling Problem with the Total Tardiness Criterion Minimization," Sustainability, MDPI, vol. 9(6), pages 1-16, June.
- Pan, Quan-Ke & Ruiz, Rubén, 2014. "An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem," Omega, Elsevier, vol. 44(C), pages 41-50.
- Nader Azad & Georgios Saharidis & Hamid Davoudpour & Hooman Malekly & Seyed Yektamaram, 2013. "Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach," Annals of Operations Research, Springer, vol. 210(1), pages 125-163, November.
- N. Beheshti Asl & S. A. MirHassani, 2019. "Accelerating benders decomposition: multiple cuts via multiple solutions," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 806-826, April.
- Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
- Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric, 2022. "Meta partial benders decomposition for the logistics service network design problem," European Journal of Operational Research, Elsevier, vol. 300(2), pages 473-489.
- Walter Rei & Jean-François Cordeau & Michel Gendreau & Patrick Soriano, 2009. "Accelerating Benders Decomposition by Local Branching," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 333-345, May.
- Hanif Sherali & Ki-Hwan Bae & Mohamed Haouari, 2013. "A benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture," Annals of Operations Research, Springer, vol. 210(1), pages 213-244, November.
- de Sá, Elisangela Martins & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2013. "An improved Benders decomposition algorithm for the tree of hubs location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 185-202.
- Anne Mercier, 2008. "A Theoretical Comparison of Feasibility Cuts for the Integrated Aircraft-Routing and Crew-Pairing Problem," Transportation Science, INFORMS, vol. 42(1), pages 87-104, February.
- Morton O’Kelly & Henrique Luna & Ricardo Camargo & Gilberto Miranda, 2015. "Hub Location Problems with Price Sensitive Demands," Networks and Spatial Economics, Springer, vol. 15(4), pages 917-945, December.
- Göke, Leonard & Schmidt, Felix & Kendziorski, Mario, 2024. "Stabilized Benders decomposition for energy planning under climate uncertainty," European Journal of Operational Research, Elsevier, vol. 316(1), pages 183-199.
- S. S. Panwalkar & Christos Koulamas, 2020. "Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines," Journal of Scheduling, Springer, vol. 23(1), pages 145-154, February.
- Federico Della Croce & Andrea Grosso & Fabio Salassa, 2021. "Minimizing total completion time in the two-machine no-idle no-wait flow shop problem," Journal of Heuristics, Springer, vol. 27(1), pages 159-173, April.
- Marufuzzaman, Mohammad & Eksioglu, Sandra D. & Li, Xiaopeng & Wang, Jin, 2014. "Analyzing the impact of intermodal-related risk to the design and management of biofuel supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 122-145.
- Azad, Nader & Hassini, Elkafi, 2019. "Recovery strategies from major supply disruptions in single and multiple sourcing networks," European Journal of Operational Research, Elsevier, vol. 275(2), pages 481-501.
More about this item
Keywords
Flowshop scheduling; Mixed no-idle; Benders decomposition; Referenced local search;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:23:y:2020:i:4:d:10.1007_s10951-020-00637-8. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.