نتایج جستجو برای: flexible flow shop scheduling

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

In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexibl...

Journal: :Journal of the Operations Research Society of China 2014

Journal: :RAIRO - Theoretical Informatics and Applications 1996

Journal: :Transactions of the Institute of Systems, Control and Information Engineers 1991

Journal: :journal of industrial engineering, international 2011
vijay kumar a. n. narashima murthy krishnappa chandrashekara

scheduling of production in flexible manufacturing systems (fmss) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. the generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. genetic algorithms are used in this paper to obtain an initial...

2012
Wajdi Trabelsi

This thesis deals mainly with makespan minimization in Flow-Shop and hybrid Flow-Shop scheduling problems where mixed blocking constraints are considered. In Flow-Shop scheduling problem, a set of N jobs must be executed on a set of M machines. All jobs require the same operation order that must be executed according to the same manufacturing process. Each machine can only execute one job at an...

2015
Suk-Hun Yoon

A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flo...

2012
Ahmad Rabanimotlagh

In this paper an ant colony optimization algorithm is developed to solve the permutation flow shop scheduling problem. In the permutation flow shop scheduling problem which has been vastly studied in the literature, there are a set of machines and a set of jobs. All the jobs are processed on all the machines and the sequence of jobs being processed is the same on all the machines. Here this pro...

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

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