نتایج جستجو برای: job shop scheduling problem

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

2016
Y. Yang Li

Flexible job-shop scheduling problem (FJSP) in the field of production scheduling presents a quite difficult combinatorial optimization problem. Machines are mostly considered to be the only resource in many research projects dealing with FJSP. In actual production, there are many other factors which influence production scheduling, such as transportation, storage and detection. If machines are...

2012
Seyed Habib A. Rahmati

During last decades, developing multi-objective evolutionary algorithms for optimization problems has found considerable attention. Flexible job shop scheduling problem, as an important scheduling optimization problem, has found this attention too. However, most of the multi-objective algorithms that are developed for this problem use nonprofessional approaches. In another words, most of them c...

Journal: :Networks 2015
Andrea D'Ariano Dario Pacciarelli Marco Pistelli Marco Pranzo

The Aircraft Scheduling Problem (ASP) is the real-time problem of scheduling take-off and landing operations at a congested airport in a given time horizon, taking into account the runways and the air segments in the Terminal Maneuvering Area (TMA). The ASP can be viewed as a job shop scheduling problem with additional real-world constraints. Compared with the current literature based on job sh...

2017
Guido Guizzi Silvestro Vespoli Stefania Santini

The recently emerged Fourth Industrial Revolution (Industry 4.0) is characterised by the introduction of the new Cyber-Physical System (CPS) concepts and the Internet of Things (IoT) paradigm. These new collaborating computational entities offer a broad range of opportunity to consider with a different perspective. One of the perennial problems of the manufacturing operation is the scheduling p...

2011
Karin Thörnblad

Volvo Aero has invested in a complex production cell containing a set of multipurpose machines. The problem of finding optimal schedules for this multitask cell is a complex combinatorial optimization problem which is recognized as a flexible job shop problem. This thesis proposes an approach to find such schedules using mathematical optimization. The mathematical models developed so far are pr...

2015
Yanfang Yu Yue Ying

Rapid development of the Internet of Things not only provides large amounts of data to the job-shop scheduling, but also proposes a great challenge for dynamic job shop scheduling. A dynamic job shop scheduling approach is proposed based on the data-driven genetic algorithm. Application examples suggest that this approach is correct, feasible and available. This approach can provide the technic...

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

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