Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a...

Aggregate production-distribution planning (APDP) is one of the most critical and strategic process in supply chains. Considering the prevalence of supplier selection and inventory control problems in supply chain management, this paper addresses the economic optimization of supply chain...

In this study, the integrated forward/reverse logistics network was investigated, and a capacitated multi-stage logistics network design was proposed by formulating a generalized logistics network problem into a mixed-integer nonlinear programming model (MINLP) for minimizing the total cost of...

Supply chain scheduling is an integrated approach to the production planning and inventory control of systems. The purpose of this paper is to formulate the generalized supply chain scheduling issue in which the objective is to minimize sum of the costs incurred within all of the echelons of...

A cutting stock problem is one of the main and classical problems in operations research that is modeled as LP problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms,...