نتایج جستجو برای: scheduling dynamic flexible flow line simulation heuristics genetic programming

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

Ahmad Mehrabian, Kaveh Khalili-Damaghani Reza Tavakkoli-Moghaddam,

The efficiency of transportation system management plays an important role in the planning and operation efficiency of flexible manufacturing systems. Automated Guided Vehicles (AGV) are part of diversified and advanced techniques in the field of material transportation which have many applications today and act as an intermediary between operating and storage equipment and are routed and contr...

2015
Jitti Jungwattanakit Manop Reodecha Paveena Chaovalitwongse Frank Werner

This paper presents an investigation of scheduling procedures to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static flexible flow shop scheduling environment. The flexible flow shop problem is a scheduling of jobs in a flow shop environment consisting of series of production stages, some of which may have only one machine, but at least one ...

Journal: :J. Intelligent Manufacturing 2005
Lixin Tang Wenxin Liu Jiyin Liu

A hybrid flow shop (HFS) is a generalized flow shop with multiple machines in some stages. HFS is fairly common in flexible manufacturing and in process industry. Because manufacturing systems often operate in a stochastic and dynamic environment, dynamic hybrid flow shop scheduling is frequently encountered in practice. This paper proposes a neural network model and algorithm to solve the dyna...

2007
Domagoj Jakobovic Leonardo Jelenkovic Leo Budin

In this paper we present a method for creating scheduling heuristics for parallel proportional machine scheduling environment and arbitrary performance criteria. Genetic programming is used to synthesize the priority function which, coupled with an appropriate metaalgorithm for a given environment, forms the priority scheduling heuristic. We show that the procedures derived in this way can perf...

2016
John Park Yi Mei Su Nguyen Gang Chen Mark Johnston Mengjie Zhang

Job shop scheduling (JSS) problems are optimisation problems that have been studied extensively due to their computational complexity and application in manufacturing systems. This paper focuses on a dynamic JSS problem to minimise the total weighted tardiness. In dynamic JSS, jobs’ attributes are only revealed after they arrive at the shop floor. Dispatching rule heuristics are prominent appro...

Journal: :International Journal of Approximate Reasoning 1998

2016
Dominik Šišejković

With the growth of projects in complexity, size and resource demands, finding fea-sible schedules of good quality becomes a very challenging task within project man-agement. Therefore the resource constrained project scheduling problem (RCPSP) hasbeen studied extensively during the last decades yielding a variety of exact and heuris-tic solving approaches. In this context, the m...

Journal: :European Journal of Operational Research 2006
George J. Kyparisis Christos Koulamas

We consider the multistage flexible flow shop scheduling problem with uniform parallel machines in each stage and the objective of minimizing makespan. We develop a general class of heuristics for this strongly NP-hard problem that extend several well-known heuristics for the corresponding embedded serial flow shop problem, and obtain absolute performance guarantees for heuristics in this class...

2008
M. Murugan V. Selladurai

In recent years Cellular Manufacturing has become an effective tool for improving productivity. Attainment of full benefits of Cellular Manufacturing depends firstly on the design of the machine cells and part families, secondly on the method of operations which takes full advantage of cell properties. Inappropriate methods of loading and scheduling can even lead to the failure of the Cellular ...

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

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