Data for: Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem

Published: 1 Feb 2019 | Version 1 | DOI: 10.17632/2kykngrt7t.1
Contributor(s):

Description of this data

All the results used in Section 6.2.

Experiment data files

This data is associated with the following publication:

Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem

Published in: Expert Systems with Applications

Latest version

  • Version 1

    2019-02-01

    Published: 2019-02-01

    DOI: 10.17632/2kykngrt7t.1

    Cite this dataset

    GAO, Liang (2019), “Data for: Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem”, Mendeley Data, v1 http://dx.doi.org/10.17632/2kykngrt7t.1

Statistics

Views: 188
Downloads: 14

Categories

Flowshop Scheduling

Licence

CC BY 4.0 Learn more

The files associated with this dataset are licensed under a Creative Commons Attribution 4.0 International licence.

What does this mean?

This dataset is licensed under a Creative Commons Attribution 4.0 International licence. What does this mean? You can share, copy and modify this dataset so long as you give appropriate credit, provide a link to the CC BY license, and indicate if changes were made, but you may not do so in a way that suggests the rights holder has endorsed you or your use of the dataset. Note that further permission may be required for any content within the dataset that is identified as belonging to a third party.

Report