463
Views
13
CrossRef citations to date
0
Altmetric
Articles

The cutting stock problem with multiple manufacturing modes applied to a construction industry

ORCID Icon, ORCID Icon & ORCID Icon
Pages 1088-1106 | Received 15 Nov 2018, Accepted 16 Jan 2020, Published online: 11 Feb 2020

References

  • Abdelmaguid, T. F., M. A. Shalaby, and M. A. Awwad. 2014. “A Tabu Search Approach for Proportionate Multiprocessor Open Shop Scheduling.” Computational Optimization and Applications 58 (1): 187–203.
  • Arbib, C., F. Marinelli, and P. Ventura. 2016. “One-Dimensional Cutting Stock with a Limited Number of Open Stacks: Bounds and Solutions from a New Integer Linear Programming Model.” International Transactions in Operational Research 23 (1-2): 47–63.
  • Arenales, M. N., A. C. Cherri, D. N. D. Nascimento, and A. Vianna. 2015. “A New Mathematical Model for the Cutting Stock/Leftover Problem.” Pesquisa Operacional 35 (3): 509–522.
  • Balakrishnan, A., and J. Geunes. 2003. “Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing.” Operations Research 51 (1): 94–112.
  • Ballestín, F., A. Barrios, and V. Valls. 2013. “Looking for the Best Modes Helps Solving the MRCPSP/Max.” International Journal of Production Research 51 (3): 813–827.
  • Bertoli, F., P. Kilby, and T Urli. 2019. “A Column-Generation-based Approach to Fleet Design Problems Mixing Owned and Hired Vehicles.” International Transactions in Operational Research 27 (2): 899–923.
  • Beşikci, U., Ü. Bilge, and G. Ulusoy. 2015. “Multi-Mode Resource Constrained Multi-project Scheduling and Resource Portfolio Problem.” European Journal of Operational Research 240 (1): 22–31.
  • Bianco, L., J. Blazewicz, P. Dell'Olmo, and M. Drozdowski. 1997. “Preemptive Multiprocessor Task Scheduling with Release Times and Time Windows.” Annals of Operations Research 70: 43–55.
  • Bischoff, E. E., and G. Wäscher. 1995. “Special Issue on Cutting and Packing.” European Journal of Operational Research 84 (3): 503–505.
  • Blazewicz, J., J. K. Lenstra, and A. R. Kan. 1983. “Scheduling Subject to Resource Constraints: Classification and Complexity.” Discrete Applied Mathematics 5 (1): 11–24.
  • Brucker, P., A. Drexl, R. Möhring, K. Neumann, and E. Pesch. 1999. “Resource-Constrained Project Scheduling: Notation, Classification, Models, and Methods.” European Journal of Operational Research 112 (1): 3–41.
  • Chen, W., L. Lei, Z. Wang, M. Teng, and J. Liu. 2018. “Coordinating Supplier Selection and Project Scheduling in Resource-Constrained Construction Supply Chains.” International Journal of Production Research 56 (19): 6512–6526.
  • Cheng, J., J. Fowler, K. Kempf, and S. Mason. 2015. “Multi-mode Resource-constrained Project Scheduling Problems with Non-Preemptive Activity Splitting.” Computers & Operations Research 53: 275–287.
  • Chopra, S., and P Meindl. 2007. “Supply Chain Management. Strategy, Planning & Operation.” In Das summa summarum des Management, 265–275. Springer.
  • Chou, F. D. 2013. “Particle Swarm Optimization with Cocktail Decoding Method for Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks.” International Journal of Production Economics 141 (1): 137–145.
  • Denton, B., and D. Gupta. 2004. “Strategic Inventory Deployment in the Steel Industry.” IIE Transactions 36 (11): 1083–1097.
  • Drozdowski, M.. 1996. “Scheduling Multiprocessor Tasks – An Overview.” European Journal of Operational Research 94 (2): 215–230.
  • Erjavec, J., M. Gradišar, and P. Trkman. 2009. “Renovation of the Cutting Stock Process.” International Journal of Production Research 47 (14): 3979–3996. doi:10.1080/00207540801935624.
  • Fan, Y., F. Schwartz, and S. Voß. 2017. “Flexible Supply Chain Planning Based on Variable Transportation Modes.” International Journal of Production Economics 183: 654–666. http://www.sciencedirect.com/science/article/pii/S0925527316302134. SI:Flexible & Robust SCs.
  • Flores-Quiroz, A., J. M. Pinto, and Q Zhang. 2019. “A Column Generation Approach to Multiscale Capacity Planning for Power-Intensive Process Networks.” Optimization and Engineering 20 (4): 1001–1027.
  • Foerster, H., and G. Wascher. 2000. “Pattern Reduction in One-dimensional Cutting Stock Problems.” International Journal of Production Research 38 (7): 1657–1676.
  • Gallego, G., K. Katircioglu, and B. Ramachandran. 2006. “Semiconductor Inventory Management with Multiple Grade Parts and Downgrading.” Production Planning & Control 17 (7): 689–700.
  • Gilmore, P. C., and R. E. Gomory. 1961. “A Linear Programming Approach to the Cutting-Stock Problem.” Operations Research 9 (6): 849–859.
  • Gilmore, P. C., and R. E. Gomory. 1963. “A Linear Programming Approach to the Cutting Stock Problem–Part II.” Operations Research 11 (6): 863–888.
  • Gomes, A. M., J. F. Gonçalves, R. Alvarez-Valdés, and V. de. Carvalho. 2013. “Special Issue on ‘Cutting and Packing’.” International Transactions in Operational Research 20 (3): 441–442.
  • Hale, W., D. F. Pyke, and N Rudi. 2000. “An Assemble-to-Order System with Component Substitution.” In Proceedings of the 4th INFORMS M&SOM Conference Ann Arbor, MI.
  • Hartmann, S., and D. Briskorn. 2010. “A Survey of Variants and Extensions of the Resource-Constrained Project Scheduling Problem.” European Journal of Operational Research 207 (1): 1–14.
  • Hübner, A., and K. Schaal. 2017. “An Integrated Assortment and Shelf-Space Optimization Model with Demand Substitution and Space-Elasticity Effects.” European Journal of Operational Research 261 (1): 302–316.
  • Jarboui, B., N. Damak, P. Siarry, and A. Rebai. 2008. “A Combinatorial Particle Swarm Optimization for Solving Multi-Mode Resource-Constrained Project Scheduling Problems.” Applied Mathematics and Computation 195 (1): 299–308.
  • Kolisch, R. 1995. Project Scheduling Under Resource Constraints: Efficient Heuristics for Several Problem Classes. Nova York: Springer.
  • Kolisch, R., and A. Drexl. 1997. “Local Search for Nonpreemptive Multi-Mode Resource-Constrained Project Scheduling.” IIE Transactions 29 (11): 987–999.
  • Lang, J. C., and W. Domschke. 2010. “Efficient Reformulations for Dynamic Lot-Sizing Problems with Product Substitution.” OR Spectrum 32 (2): 263–291.
  • Liang, Z., F. Xiao, X. Qian, L. Zhou, X. Jin, X. Lu, and S. Karichery. 2018. “A Column Generation-based Heuristic for Aircraft Recovery Problem with Airport Capacity Constraints and Maintenance Flexibility.” Transportation Research Part B: Methodological 113: 70–90.
  • Ma, P., C. Zhang, X. Hong, and H. Xu. 2018. “Pricing Decisions for Substitutable Products with Green Manufacturing in a Competitive Supply Chain.” Journal of Cleaner Production 183: 618–640.
  • Martin, M., P. H. Hokama, R. Morabito, and P. Munari. 2019. “The Constrained Two-Dimensional Guillotine Cutting Problem with Defects: An ILP Formulation, a Benders Decomposition and a CP-based Algorithm.” International Journal of Production Research 1–18. doi:10.1080/00207543.2019.1630773.
  • Melega, G. M., S. A. de Araujo, and R. Jans. 2018. “Classification and Literature Review of Integrated Lot-Sizing and Cutting Stock Problems.” European Journal of Operational Research 271 (1): 1–19.
  • Meng, X. 2019. “Lean Management in the Context of Construction Supply Chains.” International Journal of Production Research 57 (11): 3784–3798.
  • Neidlein, V., A. Scholz, and G. Wäscher. 2016. “SLOPPGEN: A Problem Generator for the Two-dimensional Rectangular Single Large Object Placement Problem with Defects.” International Transactions in Operational Research 23 (1–2): 173–186.
  • Pak, H. T. J. 2016. “Procurement Optimization under a Flexible Bill-of-Materials.” Unpublished doctoral dissertation.
  • Pan, Q., X. He, K. Skouri, S.-C. Chen, and J.-T. Teng. 2018. “An Inventory Replenishment System with Two Inventory-based Substitutable Products.” International Journal of Production Economics 204: 135–147.
  • Pentico, D. W. 1988. “The Discrete Two-Dimensional Assortment Problem.” Operations Research 36 (2): 324–332.
  • Poldi, K. C., and S. A. de Araujo. 2016. “Mathematical Models and a Heuristic Method for the Multiperiod One-Dimensional Cutting Stock Problem.” Annals of Operations Research 238 (1–2): 497–520.
  • Riise, A., C. Mannino, and L. Lamorgese. 2016. “Recursive Logic-based Benders' Decomposition for Multi-Mode Outpatient Scheduling.” European Journal of Operational Research 255 (3): 719–728.
  • Saberi, Z., O. Hussain, M. Saberi, and E Chang. 2017. “Online Retailer Assortment Planning and Managing under Customer and Supplier Uncertainty Effects Using Internal and External Data.” In 2017 IEEE 14th International Conference on e-business Engineering (ICEBE), 7–14.
  • Sadowski, W. 1959. “A Few Remarks on the Assortment Problem.” Management Science 6 (1): 13–24.
  • Shin, H., S. Park, E. Lee, and W. Benton. 2015. “A Classification of the Literature on the Planning of Substitutable Products.” European Journal of Operational Research 246 (3): 686–699.
  • Taşkın, Z. C., and A. T. Ünal. 2009. “Tactical Level Planning in Float Glass Manufacturing with Co-Production, Random Yields and Substitutable Products.” European Journal of Operational Research 199 (1): 252–261.
  • Tomat, L., and M. Gradišar. 2017. “One-Dimensional Stock Cutting: Optimization of Usable Leftovers in Consecutive Orders.” Central European Journal of Operations Research 25 (2): 473–489.
  • Van Peteghem, V., and M. Vanhoucke. 2014. “An Experimental Investigation of Metaheuristics for the Multi-Mode Resource-Constrained Project Scheduling Problem on New Dataset Instances.” European Journal of Operational Research 235 (1): 62–72.
  • Wang, W., Z. Shi, L. Shi, and Q. Zhao. 2019. “Integrated Optimisation on Flow-Shop Production with Cutting Stock.” International Journal of Production Research 57 (19): 5996–6012. doi:10.1080/00207543.2018.1556823.
  • Wäscher, G., H. Haußner, and H. Schumann. 2007. “An Improved Typology of Cutting and Packing Problems.” European Journal of Operational Research 183 (3): 1109–1130.
  • Weglarz, J., J. Jozefowska, M. Mika, and G. Waligora. 2011. “Project Scheduling with Finite or Infinite Number of Activity Processing Modes–A Survey.” European Journal of Operational Research 208 (3): 177–205.
  • Wolfson, M. 1965. “Selecting the Best Lengths to Stock.” Operations Research 13 (4): 570–585.
  • Zahiri, B., P. Jula, and R. Tavakkoli-Moghaddam. 2018. “Design of a Pharmaceutical Supply Chain Network Under Uncertainty Considering Perishability and Substitutability of Products.” Information Sciences 423: 257–283.
  • Zhang, Li, and C. Tam. 2006. “Heuristic Scheduling of Resource-Constrained, Multiple-Mode and Repetitive Projects.” Construction Management and Economics 24 (2): 159–169.
  • Zhang, Z., and J. Xu. 2016. “Bi-Level Multiple Mode Resource-constrained Project Scheduling Problems Under Hybrid Uncertainty.” Journal of Industrial and Management Optimization 12 (2): 565–593.

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.