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

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

F . Jolai Mohammad Mirabi S. M. T. Fatemi Ghomi

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

2017
Sameer Sharma

This paper pertains to a two machine flowshop scheduling involving independent setup time, transportation time and job block criteria in fuzzy environment. Further, a single transporting agent which carries the jobs from one machine to another is also considered. The objective of the paper is to minimize the makespan, idle time of the machines whenever the processing time, setup time each are u...

2015
Shine-Der Lee Yen-Chen Fu

An integrated production/delivery quantity model in a make-to-order producer–buyer supply chain is analyzed in this paper. The coordinated policy is achieved by scheduling single setup at the producer with multi-delivery to the buyer. We develop two synchronized cost models that include setup cost at the producer, ordering cost at the buyer, inventory carrying cost, and transportation cost that...

Ali Mahmoodirad Masoud Sanei Reza Soltani Saber Molla-Alizadeh-Zavardehi

In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...

Journal: :Appl. Soft Comput. 2003
Pei-Chann Chang Jih-Chang Hsieh Yen-Wen Wang

The frequent changeovers in the production processes indicate the importance of setup time in many real-world manufacturing activities. The traditional approaches in dealing with setup times are that either to omit or to merge into the processing times so as to simplify the problems. These approaches could reduce the complexity of the problem, but often generated unrealistic outcomes because of...

2003
S. A. KRAVCHENKO

In this paper, we consider the problem of scheduling jobs on parallel machines with setup times. The setup has to be performed by a single server. The objective is to minimize the schedule length (makespan), ss well as the forced idle time. The makespan problem is known to be NP-hard even for the csse of two identical parallel machines. This paper presents a pseudopolynomial algorithm for the c...

Journal: :جغرافیا و توسعه فضای شهری 0
براتعلی خاکپور زینب فاریابی

one of the main challenges facing urban planning in the late 20th century is the growth rate of traffic that influences access to sustainable urban development. one of the solutions proposed for traffic—as well as the economic, social, and environmental problems originating from it—in large cities has been the applying of traffic restrictions during certain times and in specific places in order...

Abolfazl Adressi, Reza Bashirzadeh Saeed Tasouji Hassanpour Vahid Azizi

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

Hamid Davoudpour Hamidreza Kia Seyed Hassan Ghodsypour

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...

D. Gupta, S. Sharma,

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

20042005200620072008200920102011201220132014201520162017201820192020202120222023050000010000001500000

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

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