A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

Oğuz, Ceyda; Ercan, M. Fikret

doi:10.1007/s10951-005-1640-y

Cited by 161 publications

(103 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The proposed RKGA outperformed several other specialized heuristics including those of [104]. In [139], a multi-processor problem was considered. A GA, similar to the one presented in [220], was compared with the sophisticated TS of [142] and obtained better results.…”

Section: Metaheuristicsmentioning

confidence: 99%

“…Another real world application is given in [87], where a real printed circuit board manufacturing system modeled as a 3-stage HFS is approached with GA. The HFS with multiprocessor tasks is studied for the makespan criterion by [175] and by [139] and approached with GA. A GA and a SA were proposed for a fairly complex cyclic scheduling flexible flow line with lot sizing in [85]. Another complex problem with production time windows in flexible flow lines is exposed in [151].…”

Section: Metaheuristicsmentioning

confidence: 99%

See 1 more Smart Citation

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

680

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: Metaheuristicsmentioning

confidence: 99%

Section: Metaheuristicsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

680

236

View full text Add to dashboard Cite

show abstract

“…In this regard, numerous of scholars have made attempts to schedule via divergent methods includingclassical scheduling (Zhang, 2010), genetic algorithm (Taghavifard et al, 2009;Oguz and Ercan, 2005), neural network artificial (Venkatachalam et al, 2008), fuzzy logic (Omar, 2007;Vinod and Sridharan, 2008), programming model (Chen, 2010) and so on. Kapanoglu and Alikalfa (2011) proposed that scheduling is an indispensable task for manufacturing systems in today's harsh competitive markets.…”

Section: Introductionmentioning

confidence: 99%

Development of Priority Oriented Scheduling Method to Increase the Reliability of Manufacturing Systems

Nojabaei¹,

Leman²,

Tang³

et al. 2012

American Journal of Applied Sciences

View full text Add to dashboard Cite

Scheduling occurs in every organization without considering the nature of its activities. In this regard, numerous scholars have attempted to schedule via divergent methods including classical scheduling, genetic algorithm, neural network and fuzzy logic and so on. Studies in manufacturing scheduling mostly deal with priority rules without any consideration of the system states. An appropriate scheduling leads to significant enhancement of fairness in job scheduling. The term fairness can be transformed into a specific selection of job weights. There is no method of scheduling in which priority, time action (duration) and time stamp of jobs have simultaneously been considered. But the proposed method of scheduling can enhance the efficiency and reliability of manufacturing systems. To fulfill this target, first and foremost, the normalize method should be performed. This method allows data (time stamp, time action, priority) of jobs on different scales to be compared by bringing them to a common scale. Secondly, the jobs should be arranged based on three criteria which are priority, time action and time stamp. This sorting algorithm is programmed via MATLAB Distributed Computing Server (DCS) software. Eventually, to evaluate the proposed method of scheduling, simulation is operated. The simulated algorithm shows that applying the proposed method of scheduling increases the efficiency of simulated scheduler in comparison with applying the common method of scheduling. Besides the mentioned simulated algorithm, there is a mathematical proof to show the enhancement of reliability.

show abstract

“…[8], [10], [11], among others), where a number of parallel machines are available at each stage. Other relevant references that study flowshops with a critical machine are: [4] who proposed an IP model and a heuristic algorithm for the setting of two dedicated machines; [5] who introduced a heuristic method for a two-stage job shop with multiple machines; and [7] who addressed real-life two-stage hybrid flowshop, taken from a label sticker manufacturing company, and presented a heuristic method to minimize maximal tardiness.…”

Section: Introductionmentioning

confidence: 99%

A two-stage flow shop scheduling with a critical machine and batch availability

Gerstl

Mosheiov

2012

Foundations of Computing and Decision Sciences

View full text Add to dashboard Cite

Abstract. We study a two-stage flowshop, where each job is processed on the first (critical) machine, and then continues to one of two second-stage (dedicated) machines. We assume identical (but machine-dependent) job processing times. Jobs are processed on the critical machine in batches, and a setup time is required when starting a new batch. The setting assumes batch-availability, i.e., jobs become available for the second stage only when their entire batch is completed on the critical machine. We consider three objective functions: minimum makespan, minimum total load, and minimum weighted flow-time. Polynomial time dynamic programming algorithms are introduced, which are numerically shown to be able to solve problems of medium size in reasonable time. A heuristic for makespan minimization is presented and shown numerically to be both accurate and efficient..

show abstract

A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

Cited by 161 publications

References 30 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

Development of Priority Oriented Scheduling Method to Increase the Reliability of Manufacturing Systems

A two-stage flow shop scheduling with a critical machine and batch availability

Contact Info

Product

Resources

About