نتایج جستجو برای: flow shop scheduling
تعداد نتایج: 551199 فیلتر نتایج به سال:
In this paper, permutation flow shop scheduling problems (PFSS) are investigated with a genetic algorithm. PFSS problem is special type of problem. problem, there n jobs to be processed on m machines in series. Each job has follow the same machine order and each must process order. The most common performance criterion literature makespan for problems. algorithm applied minimize makespan. Taill...
The job shop scheduling problem is a combinatorial optimization problem and one of the most complex problems among various production scheduling problems. The present work assesses the effect of change in setup time’s levels on mean flow time and means tardiness measures. The simulation model of the job shop is developed for investigation purpose. Three levels of setup times i.e. SUL_1, SUL_2 a...
In 1980 Miyazaki considered the weight of a job in which weight shows the relative priority over some other job in a sequencing of different jobs. After that some researchers such as Ghanshiam Das, Singh and Singhal [1981], Panwalker [1991] Sotskov, Allahverdi and Lai [2000], Chandramouli (2005) and Belwal, Mittal (2008) had considered the idea of N-job 2 machine flow shop scheduling problem wi...
The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines. The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time. The classical brute force method for finding the probabilities of scheduling for im...
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A proportionate flexible flow shop (PFFS) is a machine environment with parallel identical machines at each stage. This study presents an effective hybrid approach based on constructive genetic algorithm (CGA) for PFFS sch...
A flexible flow shop problem can be considered as a generalization of a pure flow shop problem in which the jobs have to go through the stages in the same order. We consider a flexible flow shop problem with unrelated machines and setup times, where the processing times depend on the chosen machine and setup times are sequence-dependent. While for classical problems the processing times for eac...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید