Scheduling flexible manufacturing cells using Tabu Search

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Scheduling is an important aspect in the overall control of a flexible manufacturing system. The research presented focuses on production scheduling of jobs within a flexible manufacturing cell (FMC)-one type of flexible manufacturing system. Due to the complexity of the FMC scheduling problem, a 0-1 mixed-integer linear programming (MILP) model is formulated for M machines and N jobs with alternative routings. Although small instances of the problem can be solved optimally with MILP models, a two-stage Tabu Search (TS2) algorithm that minimises the manufacturing makespan (MS) is proposed to solve medium-to-large-scale problems more efficiently. During Stage I (construction phase), two heuristics are utilised to generate an initial feasible sequence and an initial MS solution. In Stage II (improvement phase), the acquired initial solutions from Stage I are combined with a Tabu Search meta-heuristic procedure that provides improved MS solutions. The TS2 algorithm provides tremendous savings in computational time for medium/large-sized multi-machine FMC problems.

Original languageEnglish (US)
Pages (from-to)6907-6928
Number of pages22
JournalInternational Journal of Production Research
Volume47
Issue number24
DOIs
StatePublished - Feb 1 2009

Fingerprint

Cellular manufacturing
Tabu search
Flexible manufacturing systems
Scheduling
Linear programming
Flexible manufacturing
Makespan
Mixed integer linear programming

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{fe9a92c4614f43a4aaeb7e904b203afd,
title = "Scheduling flexible manufacturing cells using Tabu Search",
abstract = "Scheduling is an important aspect in the overall control of a flexible manufacturing system. The research presented focuses on production scheduling of jobs within a flexible manufacturing cell (FMC)-one type of flexible manufacturing system. Due to the complexity of the FMC scheduling problem, a 0-1 mixed-integer linear programming (MILP) model is formulated for M machines and N jobs with alternative routings. Although small instances of the problem can be solved optimally with MILP models, a two-stage Tabu Search (TS2) algorithm that minimises the manufacturing makespan (MS) is proposed to solve medium-to-large-scale problems more efficiently. During Stage I (construction phase), two heuristics are utilised to generate an initial feasible sequence and an initial MS solution. In Stage II (improvement phase), the acquired initial solutions from Stage I are combined with a Tabu Search meta-heuristic procedure that provides improved MS solutions. The TS2 algorithm provides tremendous savings in computational time for medium/large-sized multi-machine FMC problems.",
author = "Pitts, {R. A.} and Ventura, {Jose Antonio}",
year = "2009",
month = "2",
day = "1",
doi = "10.1080/00207540802400628",
language = "English (US)",
volume = "47",
pages = "6907--6928",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "24",

}

Scheduling flexible manufacturing cells using Tabu Search. / Pitts, R. A.; Ventura, Jose Antonio.

In: International Journal of Production Research, Vol. 47, No. 24, 01.02.2009, p. 6907-6928.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Scheduling flexible manufacturing cells using Tabu Search

AU - Pitts, R. A.

AU - Ventura, Jose Antonio

PY - 2009/2/1

Y1 - 2009/2/1

N2 - Scheduling is an important aspect in the overall control of a flexible manufacturing system. The research presented focuses on production scheduling of jobs within a flexible manufacturing cell (FMC)-one type of flexible manufacturing system. Due to the complexity of the FMC scheduling problem, a 0-1 mixed-integer linear programming (MILP) model is formulated for M machines and N jobs with alternative routings. Although small instances of the problem can be solved optimally with MILP models, a two-stage Tabu Search (TS2) algorithm that minimises the manufacturing makespan (MS) is proposed to solve medium-to-large-scale problems more efficiently. During Stage I (construction phase), two heuristics are utilised to generate an initial feasible sequence and an initial MS solution. In Stage II (improvement phase), the acquired initial solutions from Stage I are combined with a Tabu Search meta-heuristic procedure that provides improved MS solutions. The TS2 algorithm provides tremendous savings in computational time for medium/large-sized multi-machine FMC problems.

AB - Scheduling is an important aspect in the overall control of a flexible manufacturing system. The research presented focuses on production scheduling of jobs within a flexible manufacturing cell (FMC)-one type of flexible manufacturing system. Due to the complexity of the FMC scheduling problem, a 0-1 mixed-integer linear programming (MILP) model is formulated for M machines and N jobs with alternative routings. Although small instances of the problem can be solved optimally with MILP models, a two-stage Tabu Search (TS2) algorithm that minimises the manufacturing makespan (MS) is proposed to solve medium-to-large-scale problems more efficiently. During Stage I (construction phase), two heuristics are utilised to generate an initial feasible sequence and an initial MS solution. In Stage II (improvement phase), the acquired initial solutions from Stage I are combined with a Tabu Search meta-heuristic procedure that provides improved MS solutions. The TS2 algorithm provides tremendous savings in computational time for medium/large-sized multi-machine FMC problems.

UR - http://www.scopus.com/inward/record.url?scp=74549114223&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=74549114223&partnerID=8YFLogxK

U2 - 10.1080/00207540802400628

DO - 10.1080/00207540802400628

M3 - Article

AN - SCOPUS:74549114223

VL - 47

SP - 6907

EP - 6928

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 24

ER -