An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
About this item
Full title
Author / Creator
Publisher
Oxford: Blackwell Publishing Ltd
Journal title
Language
English
Formats
Publication information
Publisher
Oxford: Blackwell Publishing Ltd
Subjects
More information
Scope and Contents
Contents
Thus far, the available works on the flexible assembly job‐shop scheduling problem (FAJSP) consider job processing and assembly separately. However, in some real production systems, if equipment is composed of thousands of jobs and assembled in many stages, some jobs and assemblies cannot be processed simultaneously. Therefore, this work proposes a...
Alternative Titles
Full title
An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2561940853
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2561940853
Other Identifiers
ISSN
0969-6016
E-ISSN
1475-3995
DOI
10.1111/itor.12767
