نتایج جستجو برای: parallel machines scheduling

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

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

Journal: :international journal of industrial engineering and productional research- 0
amir noroozi saber molla-alizadeh-zavardehi hadi mokhtari university of kashan

scheduling has become an attractive area for artificial intelligence researchers. on other hand, in today's real-world manufacturing systems, the importance of an efficient maintenance schedule program cannot be ignored because it plays an important role in the success of manufacturing facilities. a maintenance program may be considered as the heath care of manufacturing machines and equip...

2001
Welf Löwe Alex Liebrich

The computation of efficient schedules of task graphs for parallel machines is a major issue in parallel computing. Such algorithms are often hard to understand and hard to evaluate. We present a framework for the visualization of scheduling algorithms. Using the LogP cost model for parallel machines, we simulate the effects of scheduling algorithms for specific target machines and task graphs ...

Journal: :Intelligent Information Management 2011
Panneerselvam Senthilkumar Sockalingam Narayanan

This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem; usage o...

Alistair Clark Masoumeh Mahdieh Mehdi Bijari,

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

2009
Tony Wauters Yailen Martinez Patrick De Causmaecker Ann Nowé Katja Verbeeck

This paper addresses the application of AI techniques in a practical OR problem , i.e. scheduling. Scheduling is a scientific domain concerning the allocation of tasks to a limited set of resources over time. The goal of scheduling is to maximize (or minimize) different optimization criteria such as the makespan (i.e. the completion time of the last operation in the schedule), the occupation ra...

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

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