Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions

Hong, Won‐Hwa

doi:10.1111/j.1468-0394.2005.00297.x

Cited by 109 publications

(38 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…These include exact methods, heuristics, and metaheuristics. The present review fills in some of the gaps identified in previous reviews, like those of, [204,117,213] or more recently [151], and describes the most recent approaches. It also identifies research opportunities and proposes some interesting research lines.…”

Section: Introductionmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

668

236

View full text Add to dashboard Cite

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 for its solution.The paper discusses several variants of the HFS problem, each in turn considering different assumptions, constraints and objective functions. Research opportunities in HFS are also discussed.

show abstract

Section: Introductionmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

668

236

View full text Add to dashboard Cite

show abstract

“…However, these uncertainties are not conventionally solvable. Moreover, since this mathematical programming problem resembles a flexible scheduling by existence of some stochastic variables, this makes the problem N P-hard to be solved [44]. For example, the availability variables or the release times to shop floor are stochastic that without any pre-assumptions is not possible to be solved conventionally.…”

Section: Conwip Simulation Scenariomentioning

confidence: 99%

“…1, the shop floor in the OEM plant consists of three steps of operations; in each step, three parallel machines work together, so that each machine has its unbounded buffer size in its predecessor. Indeed, this arrangement resembles a flexible flow shop scheduling problem [44] in generic context. This flexibility and the unbounded intermediate buffers avoid the blocking phenomena, while starvation is a frequent case in this problem.…”

Section: Conwip Simulation Scenariomentioning

confidence: 99%

Toward learning autonomous pallets by using fuzzy rules, applied in a Conwip system

Mehrsai

Karimi

Scholz‐Reiter

2012

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Nowadays, material planning and control strategies are becoming continuously complex tasks spanning from individual plants to logistic networks. In fact, this is the consequence of increasing intricacy in product variants and their respective convolution in networks' structures. Customers ask for specific products with individual characteristics that force companies for more clever performances by more flexibility. For doing so, the existing planning and control systems, which work based on central monitoring and controlling, show some limitations for organizing every operation on time or in the right time. Therefore, in the recent decade, a great attention is put on decentralized control and, to some extent, autonomy. This paper tries to investigate the possibility of combining this new research paradigm with existing strategies in production logistics, in order to improve material handling and control task according to material flow criteria. To show this, an exemplary plant after decoupling point out of a logistic network is considered for simulation and analysis. This combines Conwip system with learning autonomous pallets' concept in a discrete event simulation model. Several decentralized control scenarios are experimented and compared together. Here, the learn methodology is brought to pallets based on fuzzy rules and advantage of closed loop systems.

show abstract

“…A detailed survey for the FS problem has been given by Linn and Zhang [7] and Wang [8]. Moursli and Pochet [9] presented a branch-and-bound algorithm to minimize the makespan in FS.…”

Section: Literature Reviewmentioning

confidence: 99%

An electromagnetism-inspired method for a generalized flowshop problem

Khalili

2014

Manufacturing Rev.

View full text Add to dashboard Cite

-There are two common simplifying assumptions made in the scheduling of operations. One is that machines are available continuously, and the other is that once a job completes one process it is immediately available for its next. Moreover, in flowshops, it is commonly assumed that jobs must visit all machines. In practice, however, these assumptions may not be justifiable in some applications. This paper deals with a generalized flow shop (GFS) problem with machine availability constraints, transportation times between stages, and machine skipping. The electromagnetism-like method (EM) has been successfully applied to some NP-hard problems and this has motivated us to apply and assess the effectiveness of an EM algorithm in the GFS scenarios. Simulated annealing (SA) and a number of other well-recognized heuristics to the given GFS scheduling problem that minimizes two independent objective functions, namely the total tardiness and the total completion time also has been applied. In order to evaluate the performance of the proposed EM and SA, a set of practical instances has been considered. The related results are analyzed in two parts; in term of the objective functions, and the observed effects on variables in our instances. Extensive experiments and statistical analyses demonstrate that our proposed EM is more efficient than SA and other heuristics with regards to the objective functions considered in this paper.

show abstract

Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions

Cited by 109 publications

References 51 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

Toward learning autonomous pallets by using fuzzy rules, applied in a Conwip system

An electromagnetism-inspired method for a generalized flowshop problem

Contact Info

Product

Resources

About