To acquire the competitive advantages in order to survive in the global business scenario, modern companies are now facing the problems of selecting key supply chain strategies. Strategy selection becomes difficult as the number of alternatives and conflicting criteria increases. Multi criteria decision making (MCDM) methodologies help the supply chain managers take a lead in a complex industrial set-up. The present investigation applies fuzzy MCDM technique entailing multi-objective optimization on the basis of ratio analysis (MOORA) in selection of alternatives in a supply chain. The MOORA method is utilized to three suitable numerical examples for the selection of supply chain strategies (warehouse location selection and vendor/supplier selection). The results obtained by using current approach almost match with those of previous research works published in various open journals. The empirical study has demonstrated the simplicity and applicability of this method as a strategic decision making tool in a supply chain.

This paper considers an economic lot and delivery scheduling problem (ELDSP) in a fuzzy environment with the fuzzy shelf life for each product. This problem is formulated in a flexible job shop with unrelated parallel machines, when the planning horizon is finite and it determines lot sizing, scheduling and sequencing, simultaneously. The proposed model of this paper is based on the basic period (BP) approach. In this paper, a mixed-integer nonlinear programming (MINLP) model is presented and then it is changed into two models in the fuzzy shelf life. The main model is dependent to the multiple basic periods and it is difficult to solve the resulted proposed model for large-scale problems in reasonable amount of time; thus, an efficient heuristic method is proposed to solve the problem. The performance of the proposed model is demonstrated using some numerical examples.

The increase competition and decline economy has increased the relevant importance of having reliable supply chain. The primary objective of many supply chain problems is to reduce the cost of services and, at the same time, to increase the quality of services. In this paper, we present a multi-level supply chain network by considering multi products, single resource and deterministic cost and demand. The proposed model of this paper is formulated as a mixed integer programming and we present two metaheuristics namely MOPSO and NSGA-II to solve the resulted problems. The performance of the proposed models of this paper has been examined using some randomly generated numbers and the results are discussed. The preliminary results indicate that while MOPSO is able to generate more Pareto solutions in relatively less amount of time, NSGA-II is capable of providing better quality results.

In a previously published paper by Khan et al. (2011) [Khan, M., Jaber, M.Y., & Bonney M. (2011). An economic order quantity (EOQ) for items with imperfect quality and inspection errors, International Journal of Production Economics, 133, 113-118], we found that there is a contradiction between the cycle length and the holding cost per cycle. To obtain the cycle length, the authors assumed that the returned items from the market were replaced with good quality items. However, for the holding cost per cycle, the authors implicitly assumed that the returned items were not replaced by good quality items. In this note, we first point out the contradiction. Then we fix this flaw and develop a corrected EOQ.

This study investigates optimal pricing and inventory policies for non-instantaneous deteriorating items with permissible delay in payment. The demand rate is as known, continuous and differentiable function of price while holding cost rate, interest paid rate and interest earned rate are characterized as independent fuzzy variables rather than fuzzy numbers as in previous studies. Under these general assumptions, we first formulated a fuzzy expected value model (EVM) and then some useful theoretical results have been derived to characterize the optimal solutions. An efficient algorithm is designed to determine the optimal pricing and inventory policy for the proposed model. The algorithmic procedure is demonstrated by means of numerical examples.

One of the techniques, which are used for Multiple Criteria Decision Making (MCDM) is the permutation. In the classical form of permutation, it is assumed that weights and decision matrix components are crisp. However, when group decision making is under consideration and decision makers could not agree on a crisp value for weights and decision matrix components, fuzzy numbers should be used. In this article, the fuzzy permutation technique for MCDM problems has been explained. The main deficiency of permutation is its big computational time, so a Tabu Search (TS) based algorithm has been proposed to reduce the computational time. A numerical example has illustrated the proposed approach clearly. Then, some benchmark instances extracted from literature are solved by proposed TS. The analyses of the results show the proper performance of the proposed method.

Manpower planning using annualised hours is an effective tool where seasonal demand for staff in industry exists. In annualised hours (AH) workers are contracted to work for a certain number of hours per year. The workers are associated with relative efficiency for different types of tasks. This paper proposes a Mixed Integer linear Programming (MILP) model to solve an annualised working hours planning problem when spike in demand exists. The holiday weeks for the workers are considered as partially individualised. If a worker has been assigned with more than one type of working week in a week, this will be compensated with one or more holiday week. The performance of the model is demonstrated with an example. It can be seen that this type of modelling helps to meet the spikes in demand with less capacity shortage compared with one working week in a week.

This paper considers preemption and idle time are allowed in a single machine scheduling problem with just-in-time (JIT) approach. It incorporates Earliness/Tardiness (E/T) penalties, interruption penalties and holding cost of jobs which are waiting to be processed as work-in-process (WIP). Generally in non-preemptive problems, E/T penalties are a function of the completion time of the jobs. Then, we introduce a non-linear preemptive scheduling model where the earliness penalty depends on the starting time of a job. The model is liberalized by an elaborately–designed procedure to reach the optimum solution. To validate and verify the performance of proposed model, computational results are presented by solving a number of numerical examples.

Supply chain is a network of organizations that work together and performs various business functions such as procurement of raw materials, converting the raw material into semi-finished or finished goods and distributing the same to their ultimate customers. Presence of bullwhip effect in a supply chain is costly and degrades the performance of the supply chain. Reduction in bullwhip effect can improve the efficiency or profitability of a supply chain. The objective of this paper is to know the impact of imperfect Advance Demand Information (ADI) sharing on bullwhip effect in a four-stage serial supply chain and to evaluate the supply chain performance by conducting an experiment similar to the beer distribution game. The performance measures used are variance of orders placed by each stage, fill rate, total inventory at each stage and total holding cost of the supply chain. Results show that imperfect ADI improves the performance of the supply chain. The performance of the supply chain is also evaluated under order up to level (R, S) policy with safety stock and it is found that the performance of supply chain is better when inventory policy used.

This paper addresses scheduling a set of weighted jobs on a single machine in presence of release date for delivery in batches to customers or to other machines for further processing. The problem is a natural extension of minimizing the sum of weighted flow times by considering the possibility of delivering jobs in batches and introducing batch delivery costs. The classical problem is NP-hard and then the extended version of the problem is NP-hard. The objective function is that of minimizing the sum of weighted flow times and delivery costs. The extended problem arises in a real supply chain network by cooperation between two layers of chain. Structural properties of the problem are investigated and used to devise a branch-and-bound solution scheme. Computational experiments show the efficiency of suggested algorithm for solving instances up to 40 jobs.