Log in to save to my catalogue

Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total fl...

Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total fl...

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_informaworld_taylorfrancis_310_1080_09511920902993353

Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs

About this item

Full title

Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs

Author / Creator

Publisher

Taylor & Francis

Journal title

International journal of computer integrated manufacturing, 2009-01, Vol.22 (10), p.987-998

Language

English

Formats

Publication information

Publisher

Taylor & Francis

More information

Scope and Contents

Contents

Bi-criteria improved genetic algorithm (IGA) for flowshop scheduling problem is proposed in this paper. The primary concern of flowshop scheduling problem considered in this work is to obtain the best sequence, which minimises the makespan and total flow time of all jobs. The initial population of the genetic algorithm is created using popular NEH...

Alternative Titles

Full title

Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_informaworld_taylorfrancis_310_1080_09511920902993353

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_informaworld_taylorfrancis_310_1080_09511920902993353

Other Identifiers

ISSN

0951-192X

E-ISSN

1362-3052

DOI

10.1080/09511920902993353

How to access this item