نتایج جستجو برای: idle hybrid flow shops

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

A two-stage hybrid flow shop problem can be considered as part of a larger issue; when solved, it can find a partial solution of a main and bigger problem. Here and in the current paper, a two-stage hybrid flow shop problem with one machine in the first stage and two machines in the second stage with three criteria such as: 1) maximum manufacturing time, 2) average manufacturing time and 3) sum...

Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...

2009
Marco Chiarandini

General Optimization Methods Mathematical Programming, Constraint Programming, Heuristics Problem Specific Algorithms (Dynamic Programming, Branch and Bound) Scheduling Single and Parallel Machine Models Flow Shops and Flexible Flow Shops Job Shops Resource-Constrained Project Scheduling Timetabling Interval Scheduling, Reservations Educational Timetabling Workforce and Employee Timetabling Tra...

Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs.  In this paper, just-in-time (JIT) flow shop scheduling problem with preemp...

Journal: :European Journal of Operational Research 2010
Rubén Ruiz José Antonio Vázquez Rodríguez

The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed f...

2005
Jeffrey Dean Kelly

It is well-known that production scheduling can be largely categorized into open and closed-shops (Graves (1981)). Open-shops are job-shops, flow-shops, machine-shops and project-shops and deal exclusively with the assignment, sequencing and timing decisions (Pinedo (1995)). Closed-shops on the other hand also deal with the same three decision-groups as open-shops but they also must decide on t...

2009
Masood Ghasemi

Production planning and scheduling play significant roles in manufacturing system operations and different techniques have been used to enhance their performance. Lot streaming has been studied for decades and is shown to accelerate production flow. This research deals with lot streaming in hybrid flow shops. Multiple products are processed in a multi-stage hybrid flow shop with non-identical m...

Journal: :J. Scheduling 2014
Byungsoo Na Shabbir Ahmed George L. Nemhauser Joel Sokol

This paper considers a cutting and scheduling problem of minimizing scrap motivated by float glass manufacturing and introduces the FGSP (float glass scheduling problem). We relate it to classical problems in the scheduling literature such as no-wait hybrid flow shops and cyclic scheduling. We show that the problem is NP-hard, and identify when each of the problem’s components are polynomially ...

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

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