نتایج جستجو برای: setup and transportation times

تعداد نتایج: 16850871  

2008
M. Jenabi

This paper considers the economic lot and delivery scheduling problem in a two-echelon supply chains, where a single supplier produces multiple components on a flexible flow line (FFL) and delivers them directly to an assembly facility (AF). The objective is to determine a cyclic schedule that minimizes the sum of transportation, setup and inventory holding costs per unit time without shortage....

2012
Vahid Majazi Dalfard Vahid Ranjbar

Original scientific paper This paper presents a hybrid genetic algorithm for assembly flow-shop scheduling problem with sequence-dependent setup and transportation times, with objectives, namely the minimizing of weighted, sum of total weighted squared tardiness, makespan, and total weighted squared earliness and number of tardy jobs. Since the problem is NP-hard, we solved this problem by hybr...

D. Gupta, P. Singla, S. Bala,

The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...

Journal: :International Journal of Industrial Engineering Computations 2022

In this paper it is presented an improvement of the branch and bound algorithm for permutation flow shop problem with blocking-in-process setup times objective minimizing total time tardiness, which known to be NP-Hard when there are two or more machines involved. With that in mind, a new machine-based lower exploits some structural properties problem. A database 27 classes problems, varying nu...

Journal: :International Journal of Production Management and Engineering 2017

2015
Andrea Rossi Gino Dini

This paper proposes an ant colony optimisation-based software system for solving FMS scheduling in a job-shop environment with routing flexibility, sequence-dependent setup and transportation time. In particular, the optimisation problem for a real environment, including parallel machines and operation lag times, has been approached by means of an effective pheromone trail coding and tailored a...

Bahman Naderi mostafa Zandieh Seyed Mohammad Taghi Fatemi Ghomi

This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید