Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop

Oğuz, Ceyda; Ercan, M. Fikret; Cheng, T.C.E.; Fung, Yu-Fai

doi:10.1016/s0377-2217(02)00766-x

Cited by 82 publications

(24 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other special HFSs are multiprocessor problems where operations require to be processed by more than one machine simultaneously. [141] proposed heuristics for a 2-stage multiprocessor HFS. In order to deal with uncertainty, in [76] a 2-stage problem with makespan criterion is modeled using fuzzy processing times and approached using fuzzy heuristics.…”

Section: Heuristicsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

681

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

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

681

236

View full text Add to dashboard Cite

show abstract

“…At first, researchers tried to solve the problems with only two or three stages, for which some exact algorithms and heuristics were developed [20][21][22][23][24][25]. Recently, metaheuristics have gained increasing attention in solving the HFSPMT with more complexity.…”

Section: Introductionmentioning

confidence: 99%

A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks

Zhou

Wang

et al. 2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

As the strongly NP-hard problem, the hybrid flow-shop problem with multiprocessor tasks (HFSPMT) has gained increasing attention due to its academic significance and wide application background. For many heuristics and meta-heuristics to solve the HFSPMT, decoding method is the key element to decode sequences to schedules, which has great effect on the solution quality. To narrow the idle time between the consecutive operations in the processor and to increase the flexibility in selecting processors to schedule the following operations, several rules are proposed to adjust sequences to minimize the makespan of the HFSPMT. Based on the rules, a novel and effective decoding method named forward scheduling (FS) is proposed in this paper for solving the HFSPMT. At each stage, it first decodes the solution according to the nondecreasing order of the jobs' completion times at the previous stage, and then it adjusts the processing order of the jobs dynamically according to the rules to obtain potentially better schedule. Numerical results based on the well-known benchmarks and comparisons with some existing decoding methods demonstrate the effectiveness of the proposed FS decoding method.

show abstract

“…Multiprocessor task scheduling in a hybrid flow-shop environment has recently gained the attention of the research community. To the best of our knowledge, one of the earliest papers that deal with this problem in the scheduling literature is by Oğuz and Ercan, 1997. However, due to the complexity of the problem, in the early studies (such as (Lee & Cai, 1999, Oğuz et. al., 2003) researchers targeted two layer flow-shops with multiprocessors.…”

Section: Introductionmentioning

confidence: 99%

“…al., 2003) researchers targeted two layer flow-shops with multiprocessors. Simple list based heuristics as well as meta-heuristics were introduced for the solution www.intechopen.com Particle Swarm Optimization 156 (Oğuz et al,2003, Jdrzęjowicz & Jdrzęjowicz,2003, Oğuz et al,2004. Apparently, a broader form of the problem will have arbitrary number of stages in the flow-shop environment.…”

Section: Introductionmentioning

confidence: 99%

Particle Swarm Optimization and Other Metaheuristic Methods in Hybrid Flow Shop Scheduling Problem

Ercan¹

2009

Particle Swarm Optimization

View full text Add to dashboard Cite

Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop

Cited by 82 publications

References 19 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks

Particle Swarm Optimization and Other Metaheuristic Methods in Hybrid Flow Shop Scheduling Problem

Contact Info

Product

Resources

About