Discrete artificial bee colony algorithm for lot-streaming flowshop with total flowtime minimization
Discrete artificial bee colony algorithm for lot-streaming flowshop with total flowtime minimization
About this item
Full title
Author / Creator
Publisher
Beijing: Chinese Mechanical Engineering Society
Journal title
Language
English
Formats
Publication information
Publisher
Beijing: Chinese Mechanical Engineering Society
Subjects
More information
Scope and Contents
Contents
Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is acceler...
Alternative Titles
Full title
Discrete artificial bee colony algorithm for lot-streaming flowshop with total flowtime minimization
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_wanfang_journals_jxgcxb_e201205020
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_wanfang_journals_jxgcxb_e201205020
Other Identifiers
ISSN
1000-9345
E-ISSN
2192-8258
DOI
10.3901/CJME.2012.05.990
