Two-machine flow-shop scheduling to minimize total late work: revisited-Reference-Cited by-同舟云学术

Two-machine flow-shop scheduling to minimize total late work: revisited

Published:2018-10-16 Issue:7 Volume:51 Page:1268-1278
ISSN:0305-215X
Container-title:Engineering Optimization
language:en
Short-container-title:Engineering Optimization

Author:

Chen Xin¹,Wang Zhongyu²,Pesch Erwin³⁴,Sterna Malgorzata⁵^ORCID,Błażewicz Jacek⁵⁶⁷

Affiliation:

1. School of Electronics and Information Engineering, Liaoning University of Technology, Jinzhou, PR China

2. School of Software, Dalian University of Technology, Dalian, PR China

3. Faculty III, University of Siegen, Siegen, Germany

4. Center for Advanced Studies in Management, Handelshochschule Leipzig (HHL Leipzig Graduate School of Management), Leipzig, Germany

5. Institute of Computing Science, Poznań University of Technology, Poznań, Poland

6. Institute of Bioorganic Chemistry, Polish Academy of Sciences, Poznań, Poland

7. European Centre for Bioinformatics and Genomics, Poznań, Poland

Funder

Doctoral Research Foundation of Liaoning

Poland–China Scientific & Technological Cooperation

Poznań University of Technology

Publisher

Informa UK Limited

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Control and Optimization,Computer Science Applications

Link

https://www.tandfonline.com/doi/pdf/10.1080/0305215X.2018.1519073

Reference25 articles.

1. Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints

2. Minimizing mean weighted execution time loss on identical and uniform processors

3. Open shop scheduling problems with late work criteria

4. A comparison of solution procedures for two-machine flow shop scheduling with late work criterion

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work;International Journal of Production Research;2022-12-30

2. A new perspective on single-machine scheduling problems with late work related criteria;Annals of Operations Research;2022-12-02

3. Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work;European Journal of Operational Research;2022-11

4. Single-machine scheduling with total late work and job rejection;Computers & Industrial Engineering;2022-07

5. A no-delay single machine scheduling problem to minimize total weighted early and late work;Optimization Letters;2022-02-03