در هنگام جستجو کلمه در قسمت عنوان میتوانید کلمات مورد جستجو را با کاراکتر (-) جدا کنید.
کاربرد نوع شرط:
- جایگاه : پژوهشی
- مجله: Journal of Optimization in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Mathematical Modeling,pricing,Inventory,Closed-loop supply chain,Heterogeneous vehicles routing
- چکیده:
- چکیده انگلیسی: Mathematical models have been used in many areas of supply chain management. In this paper, we present a mixed-integer non-linear programing (MINLP) model to solve a multi-period, closed-loop supply chains (CLSCs) with two echelons consist of producers and customers. In order to satisfy the demands, the producers are be able to order for materials in the beginning of each period for one or more periods. A fleet of heterogeneous vehicles are routed to deliver the products from producers to customers and to pick up defective products from the customers and move them to the collection-repair center. Also, it is assumed that the rate of defective products is related to the price. In the other words, the more expensive product, the less rate of defect. The objective function maximize the profit which comes from total cost which is subtracted from income. The income is divided two part, selling products and wastes, and total cost consists of several part such as, costs of defective products, ordering cost, cost of holding in producers and collection-repair center, transportation costs, and the cost of assigning place for collection-repair center. Finally, computational results are discussed and analyzed for a numerical example in order to demonstrate the effectiveness of the proposed model.
- انتشار مقاله: 25-06-1394
- نویسندگان: Isa Nakhai Kamalabadi,Mohammad Mohammadnejad,Ramin Sadeghian,Fardin Ahmadizar
- مشاهده
- جایگاه : پژوهشی
- مجله: Journal of Industrial and Systems Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Job shop scheduling problem,learning effects,flexible maintenance,transportation times
- چکیده:
- چکیده انگلیسی: Nowadays, scholars do their best to study more practical aspects of classical problems. Job shop Scheduling Problem (JSSP) is an important and interesting problem in scheduling literature which has been studied from different aspects so far. Considering assumptions like learning effects, flexible maintenance activities and transportation times can make this problem more close to the real life, however these assumptions have rarely been studied in this problem. This paper aims to provide a mathematical model of JSSP which covers these assumptions. MILP model is suggested, Three different sizes of instances are generated randomly, and this model has been solved for small-sized problems exactly by GAMS software and the effects of learning on reducing the value of objective function is shown. Due to the complexity of the problem, in order to obtain near optimal solutions, medium and large instances are solve by applying Ant Colony Optimization for continuous domains(ACOR) and Invasive weed Optimization (IWO) algorithm, finally results are compared.
- انتشار مقاله: 21-02-1398
- نویسندگان: Hamed Mousavipoor,Hiwa Farughi,Fardin Ahmadizar
- مشاهده
- جایگاه : پژوهشی
- مجله: Journal of Industrial and Systems Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Cross-docking,Simulated annealing algorithm,Truck scheduling,Release time
- چکیده:
- چکیده انگلیسی: In a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. Cross-docking is a logistics strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. In this study, we consider the scheduling problem of inbound and outbound trucks with multiple dock doors, aiming at the minimization of the makespan. The considered scheduling problem determines where and when the trucks must be processed; also due to the interchangeability specification of products, product assignment is done simultaneously as well. Inbound trucks enter the system according to their release times, however, there is no mandatory time constraint for outbound truck presence at a designated stack door; they should just observe their relative docking sequences. Moreover, a loading sequence is determined for each of the outbound trucks. In this research, a mathematical model is derived to find the optimal solution. Since the problem under study is NP-hard, a simulated annealing algorithm is adapted to find the (near-) optimal solution, as the mathematical model will not be applicable to solve large-scale real-world cases. Numerical examples have been done in order to specify the efficiency of the metaheuristic algorithm in comparison with the results obtained from solving the mathematical model.
- انتشار مقاله: 18-11-1394
- نویسندگان: Jamal Arkat,Parak Qods,Fardin Ahmadizar
- مشاهده
- جایگاه : پژوهشی
- مجله: Advances in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Cross-docking,Door assignment,Simulated annealing algorithm,Truck scheduling
- چکیده:
- چکیده انگلیسی: In a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. Cross-docking is a logistics strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. In this paper, we consider the scheduling problem of inbound and outbound trucks with multiple dock doors, which the aim is to minimize the makespan. In this research, a mathematical model is derived to find the optimal solution. Also a Simulated Annealing algorithm is adapted to find near optimal solution, as the mathematical model will not be applicable for large scale problems. Numerical examples are presented in order to specify the efficiency of the proposed algorithm in comparison with mathematical model.
- انتشار مقاله: 05-02-1395
- نویسندگان: Jamal Arkat,Parak Qods,Fardin Ahmadizar
- مشاهده