نتایج جستجو برای: wait flowshop

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

2015
Mageed A. Ghaleb Ibrahim M. Alharkan

The issue of sequencing and scheduling has received considerable critical attention in many fields since the early 1950s. In this research, we studied an important production scheduling system, which generally called flexible (or hybrid) flowshop scheduling problem (FFSP or HFSP). We studied this production system with an important restriction called the no-wait. The objective was to optimize t...

Journal: :Isij International 2021

This paper studies the problem of scheduling N jobs in a hybrid flowshop with unrelated parallel machines at each stage. Considering practical application presented problem, no-wait constraints and objective function total flowtime are included problem. A mathematical model is constructed novel genetic simulated annealing algorithm so-called GSAA developed to solve this In algorithm, firstly mo...

2011
W. Trabelsi

Storage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. Two last cases can lead to blocking situations. In flowshop scheduling literature, many studies and research were realized about classical flowshop problem and also about some problems with only one blocking situation. This paper deals with makespan minimization in flowshop schedulin...

Journal: :Processes 2021

In bakery production, to perform a processing task there might be multiple alternative machines that have the same functionalities. Finding an efficient production schedule is challenging due significant nondeterministic polynomial time (NP)-hardness of problem when number products, tasks, and are higher. addition, many tasks performed manually as small medium-size bakeries not fully automated....

Journal: :Journal of Industrial and Management Optimization 2021

In this paper, we consider a manufacturing system with two-machine no-wait flowshop scheduling problem where setup times are uncertain. The the performance measure of maximum lateness was addressed in literature (Computational and Applied Mathematics 37, 6774-6794) dominance relations were proposed. We establish new relation show that is, on average, about 90$ \% $ more efficient than existing ...

2013
Neelam Tyagi

In the field of scheduling, the flowshop problems have been thoroughly studied over the last six decades. In this paper we propose a concise overview of flowshop scheduling techniques evolved during this period. We surveyed the exact, heuristics and metaheuristics methods for solving various flowshop scheduling problems. As a result various optimization techniques, solution procedures are avail...

Journal: :J. Intelligent Manufacturing 2014
Andrea Rossi Michele Lanzetta

The most general flowshop scheduling problem is also addressed in the literature as nonpermutation flowshop (NPFS). Current processors are able to cope with the (n!) m combinatorial complexity of non-permutation flowshop scheduling by metaheuristics. After briefly discussing the requirements for a manufacturing layout to be designed and modeled as non-permutation flowshop, a disjunctive graph (...

2009
Wiebke Höhn Tobias Jacobs Nicole Megow

We consider a variant of no-wait flowshop scheduling that is motivated by continuous casting in the multistage production process in steel manufacturing. The task is to find a feasible schedule with a minimum number of interruptions, i.e., continuous idle time intervals on the last production stage. Based on an interpretation as Eulerian Extension Problems, we fully settle the complexity status...

2012
Harun Aydilek Ali Allahverdi

 The m-machine no-wait flowshop scheduling problem is addressed by taking into account two performance measures of makespan and mean completion time. The objective is to minimize makespan such that mean completion time is less than a certain value. A dominance relation is provided for a special case of the problem. Moreover, two new heuristics are proposed in this paper. Computational analysis...

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

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