48
Views
12
CrossRef citations to date
0
Altmetric
General Paper

A breadth-first search applied to the minimization of the open stacks

&
Pages 936-946 | Received 31 May 2011, Accepted 12 May 2014, Published online: 21 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (3)

Mateus Martin, Horacio Hideki Yanasse, Maristela O. Santos & Reinaldo Morabito. (2023) Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks. International Journal of Production Research 61:9, pages 2895-2916.
Read now
Yuankai Zhang, Minfang Huang, Xiangpei Hu & Lijun Sun. (2018) Package consolidation approach to the split-order fulfillment problem of online supermarkets. Journal of the Operational Research Society 69:1, pages 127-141.
Read now
Yaodong Cui, Xiang Song, Yan Chen & Yi-Ping Cui. (2017) New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers. Journal of the Operational Research Society 68:3, pages 269-280.
Read now

Articles from other publishers (9)

Salim Haddadi. (2021) Exponential neighborhood search for consecutive block minimization. International Transactions in Operational Research 29:5, pages 2855-2870.
Crossref
Mateus Martin, Horacio Hideki Yanasse & Maria José Pinto. (2021) Mathematical models for the minimization of open stacks problem. International Transactions in Operational Research 29:5, pages 2944-2967.
Crossref
Salim Haddadi. (2021) Iterated local search for consecutive block minimization. Computers & Operations Research 131, pages 105273.
Crossref
Leonardo C.R. Soares, Jordi Alves Reinsma, Luis H.L. Nascimento & Marco A.M. Carvalho. (2020) Heuristic methods to consecutive block minimization. Computers & Operations Research 120, pages 104948.
Crossref
Yuankai Zhang, Lijun Sun, Xiangpei Hu & Chen Zhao. (2019) Order consolidation for the last-mile split delivery in online retailing. Transportation Research Part E: Logistics and Transportation Review 122, pages 309-327.
Crossref
Vinicius Gandra Martins Santos & Marco Antonio Moreira de Carvalho. (2018) Adaptive large neighborhood search applied to the design of electronic circuits. Applied Soft Computing 73, pages 14-23.
Crossref
Rafael de Magalhães Dias Frinhani, Marco Antonio Moreira de Carvalho & Nei Yoshihiro Soma. (2018) A PageRank-based heuristic for the minimization of open stacks problem. PLOS ONE 13:8, pages e0203076.
Crossref
Gustavo Silva Paiva & Marco Antonio M. Carvalho. (2017) Improved heuristic algorithms for the Job Sequencing and Tool Switching Problem. Computers & Operations Research 88, pages 208-219.
Crossref
Júnior Rhis Lima & Marco Antonio M. Carvalho. (2017) Descent search approaches applied to the minimization of open stacks. Computers & Industrial Engineering 112, pages 175-186.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.