The project scheduling problem is both practically and theoretically of paramount importance. From the practical perspective, improvement of project scheduling as a critical part of project management process can lead to successful project completion and significantly decrease of the relevant costs. From the theoretical perspective, project scheduling is regarded as one of the in-teresting optimization issues, which has attracted the attention of many researchers in the area of operations research. Therefore, the project scheduling issue has been significantly evaluated over time and has been developed from various aspects. In this research, the topics related to Re-source-Constrained Project Scheduling Problem (RCPSP) are reviewed, recent developments in this field are evaluated, and the results are presented for future studies. In this regard, first, the standard problem of RCPSP is expressed and related developments are presented from four as-pects of resources, characteristics of activities, type of objective functions, and availability level of information. Following that, details about 216 articles conducted on RCPSP during 1980-2017 are expressed. At the end, in line with the statistics obtained from the evaluation of previ-ous articles, suggestions are made for the future studies in order to help the development of new issues in this area.

Manufacturing facilities are systems that require adequate designing, maintenance and reservations for improvement in the future. Layouts need to be effectively designed to reduce operating to the minimum. Computer simulation is a process of investigating and analyzing the behavior of production processes for effective decision-making using computers to generate solutions that will positively impact short, and long-term planning of the Plants and save costs of real-life implementation. This study investigated a 500Kg capacity shea nut processing plant using FlexSim©. The findings from the initial model were not effective and experienced bottlenecks in workstations (Roaster and Milling) sections, poor cycle and lead times coupled with manual labor, Plant efficiency was 35.7%. However, the Improvement Layout Model was able to address these bottlenecks, the results showed the Plant efficiency increased to 83.3%, shorter lead and cycle times, improved machine utilization, and throughput capacity of the Plant. The results were an indication of conformance to the layout design developed to aid in enhancing the traditional shea nut processing that is largely dominated by traditional processing practices.

Today, supply chains have been widely welcomed by industry researchers and the results of applying it may increase throughput, reduce cost, increase speed to meet customers’ needs and create competitive opportunities. This paper identifies a scientific method, which operates efficiently and effectively manages supply chain operations. In this paper, a computer simulation model is analyzed for analyzing the supply chain and the results are examined, accordingly. Using Taguchi design of experiment and running the proposed model under L27 scenarios, a two-objective optimization was performed on the estimated response surfaces, leading to a 60% increase in productivity and 40% reduction in waiting time.

The present paper aims to analyze, model and optimize regional development of rural and urban areas of Sistan & Balochestan, separately. The relationship between employment changes and growth rate of economic sections has been modeled and numbers of jobs required for providing optimum growth rate have been obtained. This paper indicates that considering the average census of five decades (1956-2006) the situation of labor market and growth rate of economic sections in urban areas are bad and worse in rural areas so that there is need to increase employment considerably in order to achieve minimum economic growth rate ( 1% growth).

The problem of portfolio optimization has always been a key concern for investors. This paper addresses a realistic portfolio optimization problem with floor, ceiling, and cardinality constraints. This problem is a mixed integer quadratic programming where traditional optimization methods fail to find the optimal solution, efficiently. The present paper develops a new hybrid approach based on an improved particle swarm optimization (PSO) and a modified simulated annealing (SA) to find the cardinality constrained efficient frontier. The proposed algorithm benefits from simple and easy characteristics of PSO with an adaptation of inertia weights and constriction factor. In addition, incorporating an SA procedure into IPSO helps escaping from local optima and improves the precision of convergence. Computational results on benchmark problems with up to 225 assets signify that our proposed algorithm exceeds not only the standard PSO but also the other heuristic algorithms previously presented to solve the cardinality constrained portfolio problem.

In this paper, an artificial neural network (ANN) model is developed to determine the optimum
level of finished goods inventory as a function of product demand, setup, holding, and material
costs. The model selects a feed-forward back-propagation ANN with four inputs, ten hidden
neurons and one output as the optimum network. The model is tested with a manufacturing
industry data and the results indicate that the model can be used to forecast finished goods
inventory level in response to the model parameters. Overall, the model can be applied for
optimization of finished goods inventory for any manufacturing enterprise in a competitive
business environment.

Nowadays electronic commerce plays an important role in many business activities, operations, and transaction processing. The recent advances on e-businesses have created tremendous opportunities to increase profitability. This paper presents a multi-objective marketing planning model which simultaneously determines efficient marketing expenditure, service cost and product & apos; s selling price in two competitive markets. To solve the proposed model, we discuss a multi-objective geometric programming (GP) approach based on compromise programming method. Since our proposed model is a signomial GP and global optimality is not guaranteed for the problem, we transform the model to posynomial form. Finally, the solution procedure is illustrated via a numerical example and a sensitivity analysis is presented.

With an ongoing progress in industries and technologies, most firms and businesses highly depend on cooperation and collaborations within a supply chain. In today’s competitive business environment, customer satisfaction plays an important role for the business survival. These matters can be secured by “supply chain”, a chain consists of various companies working together to maintain customers’ satisfaction. If various stages of different chains cooperate with each other, “supply chain network” (SCN) will be the outcome. In order to have a supply chain network or just a supply chain-operation in its best possible way, some optimization techniques are needed. In this paper, we present a close look at previous studies in the field of SCN optimization techniques and classify them based on the relative important characteristics.