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

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

Journal: :journal of optimization in industrial engineering 2015
bahman naderi mehdi yazdani

although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. this paper deals with scheduling jobs in lot streaming flexible flow line problems. the paper mathematically formulates the problem by a mixed integer linear programming model. this model solves small instances to optimality. moreo...

Journal: :Advances in economics, business and management research 2023

2017
Deepak Gupta Pradeep Bishnoi Shashi Bala

In this paper we study specially structured two stage flow shop scheduling problem with jobs in a string of disjoint job blocks having sequence independent setup times separated from processing times each associated with their respective probabilities including job weightage. In flow shop scheduling optimization of elapsed time may not always result in optimization of utilization time. Here, th...

2015
Edwin Cheng

This paper demonstrates solving the flexible flow shop scheduling problem (FFSP) with considering limited waiting time constraint, sequence dependent setup times and different ready time to minimize maximum completion time (i.e. makespan). Since the problem studied is NP-hard, metaheuristic algorithms are proper to solve this class of problems. Hence, in this 1 / 4

Journal: :International Journal of Industrial Engineering Computations 2019

Journal: :Cogent engineering 2023

Scheduling problems should not only focus on minimizing completion time, but other performances, such as energy consumption, are urgent to investigate. Many companies and researchers competing develop various methods solve this problem. One problem that has received much attention lately is the energy-efficient Hybrid Flow Shop Problem (HFSP). The HFSP also popularly called flexible flow shop T...

Abbasian, Mohammad , Nahavandi, Nasim ,

In this paper, Multi-Objective Flexible Job-Shop scheduling with Parallel Machines in Dynamic manufacturing environment (MO-FDJSPM) is investigated. Moreover considering dynamical job-shop environment (jobs arrived in non-zero time), It contains two kinds of flexibility which is effective for improving operational manufacturing systems. The non-flexibility leads to scheduling program which have...

2009
Miloš Šeda

In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem ...

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

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