An integrated tabu search algorithm for the lot streaming problem in flexible job shops

Han Dong Lu; Wei Ping He; Xu Zhou; Ya Jie Li

An integrated tabu search algorithm for the lot streaming problem in flexible job shops

Han Dong Lu, Wei Ping He, Xu Zhou, Ya Jie Li

School of Mechanical Engineering

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

To solve the problem of flexible job shop scheduling with lot-splitting, a flexible size lot-splitting scheduling algorithm based on tabu search was presented, which incorporates the predetermination of sublot sizes, the determination of schedules based on tabu search and the variation of sublot sizes, to minimize the makespan and machine workload. Performance of the algorithm was evaluated through simulations, and the results demonstrate the feasibility, efficiency and utility of the algorithm.

Original language	English
Pages (from-to)	2003-2008
Number of pages	6
Journal	Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University
Volume	46
Issue number	12
State	Published - Dec 2012

Keywords

Flexible job-shop
Lot-splitting
Scheduling
Tabu search

Cite this

@article{81df70f70fde40d6905ff5b822c2e7f9,

title = "An integrated tabu search algorithm for the lot streaming problem in flexible job shops",

abstract = "To solve the problem of flexible job shop scheduling with lot-splitting, a flexible size lot-splitting scheduling algorithm based on tabu search was presented, which incorporates the predetermination of sublot sizes, the determination of schedules based on tabu search and the variation of sublot sizes, to minimize the makespan and machine workload. Performance of the algorithm was evaluated through simulations, and the results demonstrate the feasibility, efficiency and utility of the algorithm.",

keywords = "Flexible job-shop, Lot-splitting, Scheduling, Tabu search",

author = "Lu, {Han Dong} and He, {Wei Ping} and Xu Zhou and Li, {Ya Jie}",

year = "2012",

month = dec,

language = "英语",

volume = "46",

pages = "2003--2008",

journal = "Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University",

issn = "1006-2467",

publisher = "Shanghai Jiaotong University",

number = "12",

}

TY - JOUR

T1 - An integrated tabu search algorithm for the lot streaming problem in flexible job shops

AU - Lu, Han Dong

AU - He, Wei Ping

AU - Zhou, Xu

AU - Li, Ya Jie

PY - 2012/12

Y1 - 2012/12

N2 - To solve the problem of flexible job shop scheduling with lot-splitting, a flexible size lot-splitting scheduling algorithm based on tabu search was presented, which incorporates the predetermination of sublot sizes, the determination of schedules based on tabu search and the variation of sublot sizes, to minimize the makespan and machine workload. Performance of the algorithm was evaluated through simulations, and the results demonstrate the feasibility, efficiency and utility of the algorithm.

AB - To solve the problem of flexible job shop scheduling with lot-splitting, a flexible size lot-splitting scheduling algorithm based on tabu search was presented, which incorporates the predetermination of sublot sizes, the determination of schedules based on tabu search and the variation of sublot sizes, to minimize the makespan and machine workload. Performance of the algorithm was evaluated through simulations, and the results demonstrate the feasibility, efficiency and utility of the algorithm.

KW - Flexible job-shop

KW - Lot-splitting

KW - Scheduling

KW - Tabu search

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

M3 - 文章

AN - SCOPUS:84872963394

SN - 1006-2467

VL - 46

SP - 2003

EP - 2008

JO - Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University

JF - Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University

IS - 12

ER -

An integrated tabu search algorithm for the lot streaming problem in flexible job shops

Abstract

Keywords

Other files and links

Fingerprint

Cite this