Minimizing the makespan for a serial-batching scheduling problem with arbitrary machine breakdown and dynamic job arrival
Crossref DOI link: https://doi.org/10.1007/s00170-016-8408-8
Published Online: 2016-02-12
Published Print: 2016-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Pei, Jun
Liu, Xinbao
Fan, Wenjuan
Pardalos, Panos M.
Migdalas, Athanasios
Goldengorin, Boris
Yang, Shanlin
Text and Data Mining valid from 2016-02-12