in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...

This paper presents a new mathematical programming model for the bi-criteria mixed-model assembly line balancing problem in a just-in-time (JIT) production system. There is a set of criteria to judge sequences of the product mix in terms of the effective utilization of the system. The primary goal of this model is to minimize the setup cost and the stoppage assembly line cost, simultaneously. B...

hub covering problem (hlp) is a very popular areas of research for its wide ranges of applications in different service or manufacturing industries. this paper considers a bi-objective hub covering location problem with congestion. the objectives minimize the total transportation cost and the total waiting time for all hobs, respectively. the resulted multi-objective decision-making problem is ...

Aggregate production planning (APP) is one of the most important issues carried out in manufacturing environments which seeks efficient planning, scheduling and coordination of all production activities that optimizes the company's objectives. In this paper, we develop a mixed integer linear programming (MILP) model for an integrated aggregate production planning system with closed loop supply ...

Passive systems are preferred tools for seismic control of buildings challenged by probabilistic nature of the input excitation. However, other types of uncertainty still exist in parameters of the control device even when optimally tuned. The present work concerns optimal design of multiple-tuned-mass-damper embedded on a shear building by a number of meta-heuristics. They include well-known g...

This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...

vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. the problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. this paper propose...

Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...

Nowadays, several methods in production management mainly focus on the different partners of supply chain management. In real world, the capacity of planes is limited. In addition, the recent decade has seen the rapid development of controlling the uncertainty in the production scheduling configurations along with proposing novel solution approaches. This paper proposes a new mathematical model...

optimization of cutting conditions is a non-linear optimization with constraint and it is very important to the increase of productivity and the reduction of costs. in recent years, several evolutionary and meta-heuristic optimization algorithms were introduced. the cuckoo optimization algorithm (coa) is one of several recent and powerful meta-heuristics which is inspired by the cuckoos and the...