Table 3.xls (5.5 kB)

A n × m = 5 × 6 JSSP.

Name: A n × m = 5 × 6 JSSP.
Published: 2020-12-02T18:39:21+00:00
License: https://creativecommons.org/licenses/by/4.0/
Keywords: 58 benchmark instances show, DNA algorithm, job shop scheduling problem

dataset

posted on 2020-12-02, 18:39 authored by Xiang Tian, Xiyu Liu, Hongyan Zhang, Minghe Sun, Yuzhen Zhao

A n × m = 5 × 6 JSSP.

History

Usage metrics

Read the peer-reviewed publication

A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model

PLOS ONE

Keywords

58 benchmark instances show DNA algorithm job shop scheduling problem

Licence

CC BY 4.0