Clarification of lower bounds of two-machine flowshop scheduling to minimize total late work

Jacek Błażewicz; Xin Chen; Richard C.T. Lee; Bertrand M.T. Lin; Feng-Cheng Lin; Erwin Pesch; Małgorzata Sterna; Zhongyu Wang

doi:10.1080/0305215X.2018.1554066

Scientific Information System of the Poznań University of Technology

PL EN

Main page / Publications / Clarification of lower bounds of two-machine flowshop scheduling to minimize total late work

Submit a comment

Article

Download BibTeX

Title

Clarification of lower bounds of two-machine flowshop scheduling to minimize total late work

Authors

Jacek Błażewicz (WI) ^{[ 1 ][ 2 ][ 3 ][ 2.3 ][ P ]}
Xin Chen
Richard C.T. Lee
Bertrand M.T. Lin
Feng-Cheng Lin
Erwin Pesch
Małgorzata Sterna (WI) ^{[ 3 ][ 2.3 ][ P ]}
Zhongyu Wang

^{[ 1 ]} Instytut Chemii Bioorganicznej PAN | ^{[ 2 ]} Europejskie Centrum Bioinformatyki i Genomiki | ^{[ 3 ]} Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | ^{[ P ]} employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2019

Published in

Engineering Optimization

Journal year: 2019 | Journal volume: vol. 51 | Journal number: no. 7

Article type

scientific article

Publication language

english

Pages (from - to)

1279 - 1280

DOI

10.1080/0305215X.2018.1554066

URL

https://doi.org/10.1080/0305215X.2018.1554066

Ministry points / journal

70

Ministry points / journal in years 2017-2021

70

Impact Factor

2,165

System created by Poznań University of Technology and Poznan Supercomputing and Networking Center

Log in through eKonto to add to SIS