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...

We study the resource-constrained project scheduling problem with stochastic activity durations. We introduce a new class of scheduling policies for this problem, which make a number of a-priori sequencing decisions in a pre-processing phase, while the remaining decisions are made dynamically...

Site selection is a part of strategic management activities. Location selection decisions involved many factors that may be conflicting in nature. Considering the tangible along with intangible factors in location selection problem, this paper propose a hybrid method of multi criteria decision...

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...

Data envelopment analysis (DEA) is a mathematical optimization technique that measures the relative efficiency of decision making units (DMUs) with multiple input–output. In traditional DEA models, the data of different DMUs are assumed to be measured by precise values. But, in many real...