Search

Thus far in the available literature, capability-based distributed layout (CBDL) design approaches were only developed under certain environments. Indeed, uncertainties embedded in the machine unavailability (or random machine breakdowns), product demands, and process flow data were not considered by the previous studies to achieve a robust CBDL design. However, many real-life facility layout design applications may involve different types of uncertainties simultaneously, like fuzziness and stochasticity. Based on this motivation, for the first time in the literature, this paper introduces a novel robust capability-based distributed layout (R-CBDL) design problem under a mixed fuzzy-stochastic environment. First, a new fuzzy-stochastic optimization model of the R-CBDL design problem is developed by considering the random machine breakdowns and fuzzy demand/process flow data. Then, a hybrid solution approach based on a chance-constrained stochastic programming technique with a well-known interactive fuzzy resolution method is proposed. Thus, the random machine breakdowns and fuzzy part flow rates among different machining capabilities could be easily handled via the proposed approach. Fortunately, the proposed approach can also generate various risky and risk-free robust layout design alternatives under different probabilistic scenarios and uncertainty levels (α-cuts) according to the facility designer's risk attitude. To show the validity and applicability of the proposed R-CBDL problem and hybrid solution approach, an extensive computational study with comparative analysis is first presented based on an illustrative numerical example under different machine capability overlap cases and probability distributions. Then, the performance of the proposed approach is also tested on a real-life cellular manufacturing system of a company. The computational experiments have shown that the proposed approach can accomplish more efficient robust layout design alternatives with on average 24.5% better total expected layout score when compared to the existing cellular layout of the manufacturing company. [ABSTRACT FROM AUTHOR]

Purpose: The purpose of this study is to develop a holistic optimization model for an integrated sustainable fleet planning and closed-loop supply chain (CLSC) network design problem under uncertainty. Design/methodology/approach: A novel mixed-integer programming model that is able to consider interactions between vehicle fleet planning and CLSC network design problems is first developed. Uncertainties of the product demand and return fractions of the end-of-life products are handled by a chance-constrained stochastic program. Several Pareto optimal solutions are generated for the conflicting sustainability objectives via compromise and fuzzy goal programming (FGP) approaches. Findings: The proposed model is tested on a real-life lead/acid battery recovery system. By using the proposed model, sustainable fleet plans that provide a smaller fleet size, fewer empty vehicle repositions, minimal CO2 emissions, maximal vehicle safety ratings and minimal injury/illness incidence rate of transport accidents are generated. Furthermore, an environmentally and socially conscious CLSC network with maximal job creation in the less developed regions, minimal lost days resulting from the work's damages during manufacturing/recycling operations and maximal collection/recovery of end-of-life products is also designed. Originality/value: Unlike the classical network design models, vehicle fleet planning decisions such as fleet sizing/composition, fleet assignment, vehicle inventory control, empty repositioning, etc. are also considered while designing a sustainable CLSC network. In addition to sustainability indicators in the network design, sustainability factors in fleet management are also handled. To the best of the authors' knowledge, there is no similar paper in the literature that proposes such a holistic optimization model for integrated sustainable fleet planning and CLSC network design. [ABSTRACT FROM AUTHOR]

In fuzzy mathematical programming literature, most of the transformation approaches were mainly focused on integer linear programs (ILPs) with fuzzy parameters/variables. However, ILP-based solution approaches may be inadequate for solving large-scaled combinatorial fuzzy optimization problems, like project scheduling under mixed fuzzy-stochastic environments. Moreover, many real-life project scheduling applications may contain different types of uncertainties such as fuzziness, stochasticity, and dynamism simultaneously. Based on these motivations, this paper presents a novel constraint programming (CP)-based transformation approach for solving a multi-objective and multi-mode, fuzzy-stochastic resource investment project scheduling problem (FS-MRIPSP) which is a well-known NP-complete problem. In fact, the proposed approach mainly depends on a bound and decomposition principle which divides fuzzy components of the problem into the crisp middle, lower, and upper level problems. Thus, it reduces the problem dimension and does not need to use any standard fuzzy arithmetic and ranking operations directly. Furthermore, the stochastic nature of the problem is also taken into account by using a multi-scenario-based stochastic programming technique. Finally, a weighted additive fuzzy goal program is embedded into the proposed CP-based transformation approach to produce compromise fuzzy project schedules that trade-off between expected values of project makespan and total resource usage costs. To show the validity and practicality of the proposed approach, a real-life application is presented for the production-and-operations management module implementation process of an international Enterprise Resource Planning software company. The fuzzy-stochastic project schedules generated by the proposed CP-based approach are also compared to the results of a similar ILP-based method. Computational results have shown that the CP-based approach outperforms the ILP-based method in terms of both solution quality and computational time. [ABSTRACT FROM AUTHOR]

Nowadays, there has been an increasing attention to enterprise resource planning (ERP) software implementation projects due to the rapid improvements in information technologies. In this context, project managers may face with several uncertainties during the project planning and scheduling phases. In this paper, scheduling of a multi-objective ERP implementation project is targeted under human resource constraints and uncertainty. Through the proposed interval programming based solution approach, uncertainties of the project parameters/inputs as well as the project schedules/outputs which represent the starting or completion times of the activities can be easily handled. Therefore, several alternative project schedules can be generated by making use of the proposed approach according to the risk appetite of the project managers. Additionally, efficiency and reliability factors of the human resources are also taken into account. Finally, computational results of a real-life application have shown that more applicable and reliable compromise solutions can be generated by the proposed approach considering both project makespan and effective utilization of the human resource capacities. [ABSTRACT FROM AUTHOR]

Due to successful applications of revenue management in the airline industry, in recent years, there has been a growing interest to adopt revenue management in make-to-order (MTO) manufacturing systems. Several interrelated decision problems such as order acceptance/rejection, short-term capacity planning, due date assignment, and order scheduling need to be studied simultaneously in order to manage revenues effectively in MTO manufacturing systems. Both the producer's and customer's requirements need to be taken into account through some negotiation mechanisms that are sensitive to the service-level reputation of the manufacturing companies. In this article, we propose a new dynamic bid price–based revenue management model that considers all of the aforementioned decision problems simultaneously. A simulation optimization approach is utilized in order to determine the best possible values of control parameters for bid price, due date assignment, and price increment/reduction mechanisms. The performance of the proposed integrated revenue management model is tested on both a hypothetical example and a real problem of a bridal gown company. The computational results show that the proposed model provides significant improvements in total revenue compared to other static and dynamic bid price policies. [ABSTRACT FROM AUTHOR]

In this paper, a fuzzy-stochastic optimization model is developed for an intermodal fleet management system of a large international transportation company. The proposed model integrates various strategic, tactical and operational level decisions simultaneously. Since real-life fleet planning problems may involve different types of uncertainty jointly such as randomness and fuzziness, a hybrid chance-constrained programming and fuzzy interactive resolution-based approach is employed. Therefore, stochastic import/export freight demand and fuzzy transit times, truck/trailer availabilities, the transport capacity of Ro-Ro vessels, bounds on block train services, etc. can also be taken into account concurrently. In addition to minimize overall transportation costs, optimization of total transit times and CO2 emission values are also incorporated in order to provide sustainable fleet plans by maximizing customer satisfaction and environmental considerations. Computational results show that effective and efficient fleet plans can be produced by making use of the proposed optimization model. [ABSTRACT FROM AUTHOR]

In recent years, there has been a growing attention to model and solve resource-constrained project scheduling problem (RCPSP) under uncertain environments. In most of the real-life cases, project managers may face with many uncertainties in activity durations, resource availabilities, resource requirements of the activities, the earliest and latest finishing times of the activities etc. In addition to these input parameters, project schedule which represents the starting and/or completion times of the activities should also be considered as uncertain variables in such a fully uncertain environments where all of the project data are imprecise. Based on this motivation, this paper presents an interval programming based transformation approach to overcome fully uncertain nature of the problem. In detail, classical discrete-time binary integer programming model of the deterministic problem was extended by incorporating interval-valued parameters and decision variables. Then, fully uncertain RCPSP was transformed into the crisp equivalent form by making use of interval programming, interval ranking and interval arithmetic operations. In the proposed approach, interval arithmetic operations are performed by using supplementary information obtained from the project manager. Thus, the proposed approach is also able to take into account the project managers’ attitude toward risk and produces more acceptable and risk-free solutions. Finally, a real-life liquefied natural gas (LNG) storage tank construction project in a petroleum refinery is presented for testing its validity and practicality. The computational results have shown that more applicable and information efficient project schedules can be derived via the proposed approach according to the project manager’s attitude toward risk. [ABSTRACT FROM AUTHOR]

This paper presents a novel direct solution approach for fully fuzzy transportation problems in which all of the model parameters as well as decision variables are considered as fuzzy numbers. In detail, a fuzzy decoding procedure based on constrained fuzzy arithmetic operations and a fuzzy ranking technique is first introduced for solution of the problem directly without any fuzzy to crisp transformation process. Then, this decoding procedure is embedded into a metaheuristic, namely priority-based PSO algorithm for generating new solution vectors and seeking for better fuzzy acceptable solutions. By making use of the constrained fuzzy arithmetic concept, the proposed approach is also able to handle the decision maker's attitude toward risk. In order to show validity and applicability of the proposed approach, numerical examples on both balanced and unbalanced fully fuzzy transportation cases are generated and solved. The computational results have shown that relatively more precise and information efficient solutions can be obtained from the proposed approach for "risk-averse" and "partially risk-averse" decision makers. Furthermore, the proposed approach is also able to produce fuzzy solutions for "risk seekers" with high degree of uncertainty similar to the other methods available in the literature. [ABSTRACT FROM AUTHOR]

Most of the existing methods for solving fully fuzzy mathematical programs are based on the standard fuzzy arithmetic operations and/or Zadeh's extension principle. These methods may produce questionable results for many real-life applications. Due to this fact, this paper presents a novel method based on the constrained fuzzy arithmetic concept to solve fully fuzzy balanced/unbalanced transportation problems in which all of the parameters (source capacities, demands of destinations, transportation costs etc.) as well as the decision variables (transportation quantities) are considered as fuzzy numbers. In the proposed method, the requisite crisp and/or fuzzy constraints between the base variables of the fuzzy components are provided from the decision maker according to his/her exact or vague judgments. Thereafter, fuzzy arithmetic operations are performed under these requisite constraints by taking into account the additional information while transforming the fuzzy transportation model into crisp equivalent form. Therefore, various fuzzy efficient solutions can be generated by making use of the proposed method according to the decision maker's risk attitude. In order to present the efficiency/applicability of the proposed method, different types of fully fuzzy transportation problems are generated and solved as illustrative examples. A detailed comparative study is also performed with other methods available in the literature. The computational analysis have shown that relatively more precise solutions are obtained from the proposed method for “risk-averse” and “partially risk-averse” decision makers. The proposed method also successfully provided fuzzy acceptable solutions for “risk seekers” with high degree of uncertainty similar to the other existing methods in the literature. [ABSTRACT FROM AUTHOR]

• Unequal-area capability-based facility layout design approach is firstly introduced, • A novel mixed-integer non-linear programming (MINLP) model is developed, • Heuristic decomposition-based iterative mathematical programming method is proposed, • Application study and comparisons with a real-life manufacturing system. Thus far in the available literature, capability-based facility layout design approaches were developed by only considering equal machine areas, where they are assigned to the pre-specified locations. Based on this motivation, this paper introduces a new unequal-area capability-based facility layout design (UA-CBFLD) problem for the first time in the literature. In addition to the machines' unequal-area requirements, the proper distribution of their processing capabilities over the shop floor is considered. First, a new mixed-integer non-linear programming (MINLP) model is developed. Then, a polyhedral inner-approximation method is applied to cope with non-linear area constraints. Due to its NP-hard nature and highly non-linear structure, a heuristic decomposition-based iterative solution approach is also proposed to solve realistic size problems within a reasonable time. In order to show the validity and applicability of the proposed approach, both an illustrative example with different machine-capability overlaps and a real-life application in a manufacturing company are presented. The computational results have shown that the proposed approach has found a 33.25% better layout score (as a function of the distance and the amounts of product flows) and achieved this solution 116.64% faster than the solution of the developed MINLP model via Gurobi's standard non-linear programming solver. Furthermore, when compared to the existing cellular facility layout design of the manufacturing company, the proposed capability-based unequal-area layout design option has also 29.37% and 34.74% superior layout scores under the scenarios of equal and unequal machine areas, respectively. Moreover, the total average machine utilization has increased up to 89.6%, which is comparatively better than the current average cell utilization, i.e., 65.2%. [ABSTRACT FROM AUTHOR]

Making accurate accept/reject decisions on dynamically arriving customer requests for different combinations of resources is a challenging task under uncertainty of competitors' pricing strategies. Because customer demand may be affected by a competitor's pricing action, changes in customer interarrival times should also be considered in capacity control procedures. In this article, a simulation model is developed for a bid price–based capacity control problem of an airline network revenue management system by considering the uncertain nature of booking cancellations and competitors' pricing strategy. An improved bid price function is proposed by considering competitors' different pricing scenarios that occur with different probabilities and their effects on the customers' demands. The classical deterministic linear program (DLP) is reformulated to determine the initial base bid prices that are utilized as control parameters in the proposed self-adjusting bid price function. Furthermore, a simulation optimization approach is applied in order to determine the appropriate values of the coefficients in the bid price function. Different evolutionary computation techniques such as differential evolution (DE), particle swarm optimization (PSO), and seeker optimization algorithm (SOA), are utilized to determine these coefficients along with comparisons. The computational experiments show that promising results can be obtained by making use of the proposed metaheuristic-based simulation optimization approach. [ABSTRACT FROM PUBLISHER]

Growing importance of intermodal transportation necessitates modeling and solving load planning problems by taking into account various complex decisions simultaneously like transportation mode/service type selection, load allocation, and outsourcing. This paper presents a mixed-integer mathematical programming model for a multi-objective, multi-mode and multi-period sustainable load planning problem by considering import/export load flows to satisfy transport demands of customers and many other related issues. Several multiple objective optimization procedures are utilized in order to handle conflicting objectives simultaneously under crisp and fuzzy decision making environments. A real-life case study is also performed to present application and usefulness of the proposed model. [ABSTRACT FROM AUTHOR]

Recently, there has been a growing attention to load planning problems in intermodal logistics networks by global logistics sector. However, most of the studies in the literature were concentrated on single mode problems from the perspectives of logistics companies/production firms. Since increasing importance of intermodal transportation, the problem need to be solved by handling various complex decisions simultaneously (i.e., transportation mode selection, load allocation, outsourcing and sizing of maritime and railway cruises), which makes the problem much more complex. In this study, a mixed-integer programming model is developed for a multi-objective, multi-mode and multi-period load planning problem from the perspective of freight forwarders. In the proposed model, both import/export transport demands of the customers are considered. In addition to minimize overall transport costs, it is also aimed to minimize total transit time and environmental impact resulted from CO2 emissions. In order to handle these conflicting objectives and to provide compromise solutions under uncertainty, a fuzzy goal programming approach is used. According to the computational results, effective/efficient load plans can be generated in terms of economic and environmental issues. [ABSTRACT FROM AUTHOR]

Recently, there is a growing attention by the researchers to solve and interpret the analysis of fully fuzzy linear programming problems in which all of the parameters as well as the decision variables are considered as fuzzy numbers. Under a fully uncertain environment where all of the data are stated as fuzzy, presenting the reasonable range of values for the decision variables may be comparatively better than the currently available crisp solutions so as to provide ranges of flexibility to decision makers. However, there is still a scarcity of solution methodologies on fuzzy mathematical programs with fuzzy decision variables. Based on this motivation, a new parametric method which is mainly based on α -cut representation of fuzzy intervals is proposed in this paper by incorporating the decision maker's attitude toward risk. In order to illustrate validity and practicality of the proposed method, it is applied to a generic reverse logistics network design model including fuzzy decision variables. To the best of our knowledge, this is the first study in the literature which presents fuzzy efficient solutions and analysis for a fully fuzzy reverse logistics network design problem with fuzzy decision variables. The provided solutions by the proposed method are also compared to the available solution methodologies from the literature in terms of computational efficiency, solution quality and ease of use. By using the proposed method, the decision makers can be supported by yielding fuzzy efficient solutions under different uncertainty levels and risk attitudes. The computational results have also shown that more reliable and necessarily precise solutions can be generated by the proposed method for a risk-averse decision maker. [ABSTRACT FROM AUTHOR]

• Capability based machine layout problem is introduced first time in the literature. • An integer nonlinear programming model and its linearization is developed. • The proposed model enables layout designers to better utilize flexibility. • An effective matheuristic based solution approach is devised for model solution. • A detailed computational study is performed for model testing and verification. Capability-based machine layout (CB-ML) problem is firstly introduced in this paper. In the conventional machine layout problem, part flow matrix is generated from parts' machine routes to minimize total part flows. However, defining part flow matrix based on the machines' routes (instead of processing capability requirements of parts) restricts facility designers to utilize available flexibility in manufacturing systems. In this research, parts' processing requirements are defined in terms of Resource Elements (REs), which describe unique processing capabilities and the processing capability overlaps of machines. If part flow matrix is defined in terms of REs, it becomes possible to utilize available flexibility in a more effective manner. However, physical part flows cannot be identified directly from the RE-based flow matrices. Because, the processing requirements of manufactured parts can be satisfied from alternative machines that contain the required REs. Therefore, RE-based part flow matrix must be mapped into the machine flow matrix, which requires defining the machine flow matrix as a decision variable. This makes the proposed CB-ML problem much more complicated than the conventional machine layout problem. We firstly developed an integer non-linear programming model for the proposed CB-ML problem. Because of its NP-completeness and nonlinear structure, a matheuristic-based solution approach is also developed. The extensive computational analysis have shown that the proposed approach is able to provide good quality solutions for the larger problem instances within reasonable computation times. [ABSTRACT FROM AUTHOR]

Significant environmental problems have been caused by the growth in the volume of used tires each year. In addition, remanufacturing and recycling options related to the end of life for tires are crucial issues at present because of difficulties related to the degradation of these scrap tires in the environment and the economic benefits of material and energy recovery. Thus, effective collection, storage, recycling, and appropriate disposal methods are required for used tires without damaging the environment by designing an efficient closed-loop supply chain network. Based on this motivation, we present a holistic modeling approach for a tire closed-loop supply chain using mixed integer linear programming. Alternative recovery options such as remanufacturing, recycling, and energy recovery are considered simultaneously in the model. The main objective of this study was to develop a multi-objective, multi-echelon, multi-product, and multi-period logistics network design model in a more holistic manner while also considering environmental issues. To quantify the environmental impact and the closed-loop supply chain, we used a life cycle assessment-based and damage-oriented method (eco-indicator 99). We applied the model to an illustrative case study and an interactive fuzzy goal programming approach was utilized to solve the proposed fuzzy multiple-objective network optimization model. In order to obtain the best profit values and to satisfy the environmental indicator targets, we examined the effects of some parameters (factors) within the profit and damage function using an experimental technique based on the Taguchi design. Experimental runs were conducted using the optimization solver in ILOG OPL Studio 6.3 and the results were evaluated based on Taguchi’s (S/N) ratios, analysis of means graphs, interaction graphs, and analysis of variance with MINITAB 14. [ABSTRACT FROM AUTHOR]

Recently, Reverse Logistics (RL) and product recovery options such as recycling, remanufacturing and reusing have become important issues due to the environmental, economical issues and legal regulations. Due to this fact, companies should take into account the utilized recovery option while preparing their strategic planning activities (like network design) instead of using traditional production planning models. However, since RL network design problems are in the class of NP-hard, solving large scaled problems by exact algorithms is very difficult. Therefore, many meta-heuristics optimization algorithms have been proposed to provide near optimal solutions for supply chain, RL and closed-loop supply chain network design problems in the literature. In this paper, available decoding algorithms for solving generic RL design problems are revised so as to balance the problem without introducing any dummy node on the chromosome. Moreover, the proposed decoding procedure takes into account 'equal transportation cost' situation. Then, a priority-based seeker optimization algorithm (SOA) which utilizes fuzzy reasoning procedure is developed for solution of the problem. In order to test performance of the algorithm, a numerical examined is provided and obtained results are compared with particle swarm optimization (PSO) algorithm which is another swarm intelligence technique. Computational results show that SOA is superior to PSO in terms of both solution quality and computational time for the example RL network design problem. [ABSTRACT FROM AUTHOR]

Recent years, there has been a growing interest in reverse logistics, recycling, remanufacturing, and reusing due to the environmental concerns, economical issues, and legal obligations. Companies should take into account the recovery options such as recycling, remanufacturing, etc. while preparing their tactical plans. In this paper, a mixed integer linear programming model is proposed for tactical planning in a conceptual closed-loop supply chain with remanufacturing option. In the model, both forward and reverse flows are involved and two production alternatives are considered: either production of new products directly in manufacturing plants or bringing the returned products back to 'as new condition' in the remanufacturing facilities. The proposed model attempts to optimize all of the consecutive stages in the closed-loop supply chain. Hence, the purpose of this research is to formulate a mathematical programming model to focus primarily on integrating remanufacturing as a recovery option into tactical planning process. The proposed model is applied to an illustrative case and solved by LINGO 9.0 optimization solver. In order to obtain the best objective function value that is targeted, the effects of the major factors regarding reverse flows and remanufacturing system are examined with the help of Taguchi experimental design technique at the end of the study. Analysis of variance, Taguchi's signal/noise ratios, analysis of means graphs and interaction graphs are provided by MINITAB 14 software and interpreted for the evaluation of experimental results and effects of related factors. [ABSTRACT FROM AUTHOR]

Nowadays, there has been a growing interest in reverse logistics, recycling, remanufacturing and reusing due to the environmental, economical issues and legal obligations. Due to this fact, companies should take into account the remanufacturing option while preparing the medium term planning (MTP) activities instead of using traditional production planning models. There are lots of studies in the literature related to the reverse logistics (RL) and closed-loop supply chain (CLSC) network design problem which takes place in strategic planning level but a few of them handles the medium-term planning activities. Thus, a fuzzy mixed integer programming model for medium-term planning in a CLSC related to a conceptual product with remanufacturing option is developed in this paper. In the proposed model, both forward and reverse flows are included and two production alternatives are considered: either 'production of new products directly in manufacturing plants' or 'bringing the returned products back to 'as new condition' in the remanufacturing facilities'. However, real world closed-loop supply chains are surrounded with uncertainty. Thus, storage capacities, retailers' and wholesalers' demands, return rates, acceptance ratios, weekly available production/remanufacturing times, transportation upper bounds and objective function value are considered as fuzzy in the proposed model. The proposed fuzzy mathematical programming model is converted into a crisp equivalent model by utilizing several fuzzy aggregation procedures from the literature. The proposed model is applied to an illustrative case and scenario analysis is also carried out for evaluating the effects of some parameters related to the concerned collection-recovery system. Solution of the proposed model is achieved by using ILOG OPL Studio 6.3. [ABSTRACT FROM AUTHOR]

Nowadays, so as to adapt to the global market, where competition is getting tougher, firms producing through the modern production approach need to bring not the only performance of the system designed both during the research and development phase and the production phase but also the performance of the product to be developed as well as the process to be improved to the highest level. The Taguchi method is an experimental design technique seeking to minimize the effect of uncontrollable factors, using orthogonal arrays. It can also be designed as a set of plans showing the way data are collected through experiments. Experiments are carried out using factors defined at different levels and a solution model generated in ARENA 3.0 program using SIMAN, which is a simulation language. Many experimental investigations reveal that the speed and capacity of automated-guided vehicle, the capacities of local depots, and the mean time between shipping from the main depot are the major influential parameters that affect the performance criteria of the storage system. For the evaluation of experiment results and effects of related factors, variance analysis and signal/noise ratio are used and the experiments are carried out in MINITAB15 according to Taguchi L16 scheme. The purpose of this study is to prove that experimental design is an utilizable method not only for product development and process improvement but it can also be used effectively in the design of material handling-transfer systems and performance optimization of automation technologies, which are to be integrated to the firms. [ABSTRACT FROM AUTHOR]

• A fully uncertain multi-mode RIPSP under mixed interval and stochastic uncertainty. • A hybrid interval programming and chance constrained optimization based approach. • Compromise solutions to the tradeoff between makespan and human resource costs. • A real-life application for an ERP implementation project scheduling problem. • More reliable and risk-free solutions according to project manager's risk attitude. Most of the real-life project scheduling cases may involve different types of uncertainties simultaneously such as randomness, fuzziness and dynamism. Based on this motivation, the present paper proposes a novel interval programming and chance constrained optimization based hybrid solution approach for a fully uncertain, multi-objective and multi-mode resource investment project scheduling problem (MRIPSP). The classical discrete-time binary integer programming formulation of the problem is extended by incorporating both the interval-valued and interval-stochastic project parameters as well as variables. In addition to the uncertain project parameters/inputs, the completion times of the activities which represent the project schedule and the availabilities of the renewable project resources are also stated as uncertain project variables and represented by interval numbers. Then, the proposed interval-stochastic multi-mode resource investment project scheduling (IS-MRIPSP) model is converted into its crisp equivalent form by using the proposed approach. The proposed approach is also able to consider different types of project scheduling risks and produces more reliable and risk-free solutions according to the project manager's attitude toward risks. Furthermore, in addition to the classical makespan objective, effective and efficient utilization of the renewable project resources, i.e., human resources, is also targeted. The efficiency and reliability factors of the human resources are also taken into consideration. In order to generate balanced project schedules which tradeoff between the project time and total human resource costs, compromise programming approach is adapted. Finally, in order to test the validity and practicality of the proposed approach, a real-life application is presented for an enterprise resource planning (ERP) implementation project scheduling problem of an international industrial software company. [ABSTRACT FROM AUTHOR]

Although many meta-heuristic algorithms were developed for solving combinatorial optimization problems, very few of them were realized in an agent based environment. Especially the algorithms which model dynamics of Artificial Immune Systems (AIS) are population based approaches with adaptability characteristics, therefore AIS can be better realized in an agent based modeling environment. For this purpose first time in the literature a clonal selection algorithm which is an AIS based algorithm is modeled in a multi-agent environment for solving the travelling salesmen problem which is a combinatorial optimization problem. In order to observe the behavior of the algorithm, simulation experiments are carried out on several test problems. Netlogo software is utilized for developing agent based models and simulation tests. Moreover, receptor change process and crossover mechanisms are integrated into the proposed model in order to improve the performance of the classical clonal selection algorithm. It is shown that there is a high potential to obtain good solution by making use of agent oriented approaches which more realistically model the natural phenomenon. [ABSTRACT FROM AUTHOR]