Two-stage flow-open shop scheduling problem to minimize makespan

DOI10.1007/978-3-319-42291-6_53zbMath1398.90054OpenAlexW2476154456MaRDI QIDQ1990330

Bingqian Liu, Huawei Yuan, Tao Ren, Hai-yan Li, Danyu Bai, Peng Zhao

Publication date: 25 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-42291-6_53

zbMATH Keywords

makespanasymptotic analysisdiscrete differential evolutionflow-open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: Two-stage flow-open shop scheduling problem to minimize makespan