Academic Journal

A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration

التفاصيل البيبلوغرافية
العنوان: A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration
المؤلفون: Wu, Chin-Chia, Bai, Danyu, Azzouz, Ameni, Chung, I.-Hong, Cheng, Shuenn-Ren, Jhwueng, Dwueng-Chwuan, Lin, Win-Chin, Said, Lamjed Ben
المساهمون: Ministry of Science Technology of Taiwan, National Natural Science Foundation of China
المصدر: Engineering Optimization ; volume 52, issue 6, page 1009-1036 ; ISSN 0305-215X 1029-0273
بيانات النشر: Informa UK Limited
سنة النشر: 2019
نوع الوثيقة: article in journal/newspaper
اللغة: English
DOI: 10.1080/0305215x.2019.1632303
DOI: 10.1080/0305215X.2019.1632303
الاتاحة: http://dx.doi.org/10.1080/0305215x.2019.1632303
https://www.tandfonline.com/doi/pdf/10.1080/0305215X.2019.1632303
رقم الانضمام: edsbas.4DCB6CBC
قاعدة البيانات: BASE
الوصف
DOI:10.1080/0305215x.2019.1632303