A multiproduct pipeline provides an economic way to transport large volumes of refined petroleum products over long distances. In such a pipeline, different products are pumped back−to−back without any separation device between them. The sequence and lengths of such pumping runs must be carefully selected in order to meet market demands while minimizing pipeline operational costs and satisfying several constraints. The production planning and scheduling of the products at the refinery must also be synchronized with the transportation in order to avoid the usage of the system at some peak−hour time intervals. In this paper, we propose a multi−period mixed integer nonlinear programming (MINLP) model for an optimal planning and scheduling of the production and transportation of multiple petroleum products from a refinery plant connected to several depots through a single pipeline system. The objective of this work is to generalize the mixed integer linear programming (MILP) formulation proposed by Cafaro and Cerdá (2004, Computers and Chemical Engineering) where only a single planning period was considered and the production planning and scheduling was not part of the decision process. Numerical examples show how the use of a single period model for a given time period may lead to infeasible solutions when it is used for the upcoming periods. These examples also show how integrating production planning with the transportation and the use of a multi−period model may result in a cost saving compared to using a single−period model for each period, independently.

Solving resource constrained project scheduling problem (RCPSP) has important role in the context of project scheduling. Considering a single objective RCPSP, the goal is to find a schedule that minimizes the makespan. This is NP-hard problem (Blazewicz et al., 1983) and one may use meta-heuristics to obtain a global optimum solution or at least a near-optimal one. Recently, various meta-heuristics such as ACO, PSO, GA, SA etc have been applied on RCPSP. Bee algorithms are among most recently introduced meta-heuristics. This study aims at adapting artificial bee colony as an alternative and efficient optimization strategy for solving RCPSP and investigating its performance on the RCPSP. To evaluate the artificial bee colony, its performance is investigated against other meta-heuristics for solving case studies in the PSPLIB library. Simulation results show that the artificial bee colony presents an efficient way for solving resource constrained project scheduling problem.

The primary assumptions with many multi-period inventory lot-sizing models are fixed time horizon and uniform demand variation within each period. In some real inventory situations, however, the time horizon may be unknown, uncertain or imprecise in nature and the demand pattern may vary within a given replenishment period. This paper presents an economic order quantity model for deteriorating items where demand has different pattern with unknown time horizon. The model generates optimal replenishment schedules, order quantity and costs using a general ramp-type demand pattern that allows three-phase variation in demand. Shortages are allowed with full backlogging of demand and all possible replenishment scenarios that can be encountered when shortages and demand pattern variation occur in multi-period inventory modeling are also considered. With the aid of numerical illustrations, the advantages of allowing for variation in demand pattern within replenishment periods, whenever they occur, are explored. The numerical examples show that the length of the replenishment period generated by the model varies with the changes in demand patterns.

Meta-heuristic approaches are general algorithmic framework, often nature-inspired and designed to solve NP-complete optimization problems in cellular manufacturing systems and has been a growing research area for the past two decades. This paper discusses various meta-heuristic techniques such as evolutionary approach, Ant colony optimization, simulated annealing, Tabu search and other recent approaches, and their applications to the vicinity of group technology/cell formation (GT/CF) problem in cellular manufacturing. The nobility of this paper is to incorporate various prevailing issues, open problems of meta-heuristic approaches, its usage, comparison, hybridization and its scope of future research in the aforesaid area.

This paper presents a new vendor-buyer system where there are different objectives for both sides. The proposed method of this paper is different from the other previously published works since it considers different objectives for both sides. In this paper, the vendor’s emphasis is on the crashing of the setup cost, which not only helps him compete in the market but also provides better services to his customers; and the buyer’s aim is to reduce the lead time, which not only facilitates the buyer to fulfill the customers’ demand on time but also enables him to earn a good reputation in the market or vice versa. In the light of the above stated facts, an integrated vendor-buyer stochastic inventory model is also developed. The propsed model considers two cases for demand during lead time: Case (i) Complete demand information, Case (ii) Partial demand information. The proposed model jointly optimizes the buyer’s ordered quantity and lead time along with vendor’s setup cost and the number of shipments. The results are demonstrated with the help of numerical examples.

Location-routing problem (LRP) is established as a new research area in the context of location analysis. The primary concern of LRP is on locating facilities and routing of vehicles among established facilities and existing demand points. In this work, we address the capacitated LRP which arises in many practical applications within logistics and supply chain management. The objective is to minimize the overall system costs which include the fixed costs of opening depots and using vehicles at each depot site, and the variable costs associated with delivery activities. A novel heuristic is proposed which is based on variable neighborhood descent (VND) algorithm to solve the resulted problem. The computational study indicates that the proposed VND based heuristic is highly competitive with the existing solution algorithms in terms of solution quality.

In this paper, we address the problem of scheduling jobs in a no-wait flowshop problem with sequence-dependent setup times with the objective of minimizing makespan. This problem is well-known for being nondeterministic polynomial-time hard, and small contribution to the problem has been made. We propose a new constructive heuristic named GAPH based on a structural property. The effectiveness of the structural property is crucial given that it is responsible for 100% of the success rate of the total problems tested. The computational results demonstrate that the proposed approach is superior than three of the best-know methods in the literature such as the twos by Bianco, Dell’Olmo and Giordani (INFOR Journal: 37 (1), 3-19, 1999) and TRIPS heuristic adapted for sequence-dependent setup times objective by Brown, Mcgarvey and Ventura (Journal of the Operational Research Society, 55 (6), 614-621, 2004) in terms of the solution quality and that it requires less computational effort.

In this article, we consider a single-unit unreliable production system which produces a single item. During a production run, the production process may shift from the in-control state to the out-of-control state at any random time when it produces some defective items. The defective item production rate is assumed to be imprecise and is characterized by a trapezoidal fuzzy number. The production rate is proportional to the demand rate where the proportionality constant is taken to be a fuzzy number. Two production planning models are developed on the basis of fuzzy and stochastic demand patterns. The expected cost per unit time in the fuzzy sense is derived in each model and defuzzified by using the graded mean integration representation method. Numerical examples are provided to illustrate the optimal results of the proposed fuzzy models.

This paper presents two models, a periodic review model and a continuous review inventory model with fuzzy setup cost, holding cost and shortage cost. We use two methods in the name of signed distance and possibilistic mean value to defuzzify. Also we consider the lead time demand and the lead-time plus one period’s demand as random variables. To validate the models and the solution procedures we apply them to a transformer manufacturing, 'Iran transfo', company. Furthermore we design a decision support system which can be used for efficient evaluation of the proposed models in fuzzy environment.

:In this paper, we present a multi-objective possibilistic programming model to locate distribution centers (DCs) and allocate customers' demands in a supply chain network design (SCND) problem. The SCND problem deals with determining locations of facilities (DCs and/or plants), and also shipment quantities between each two consecutive tier of the supply chain. The primary objective of this study is to consider different risk factors which are involved in both locating DCs and shipping products as an objective function. The risk consists of various components: the risks related to each potential DC location, the risk associated with each arc connecting a plant to a DC and the risk of shipment from a DC to a customer. The proposed method of this paper considers the risk phenomenon in fuzzy forms to handle the uncertainties inherent in these factors. A possibilistic programming approach is proposed to solve the resulted multi-objective problem and a numerical example for three levels of possibility is conducted to analyze the model.