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

DOI10.1080/0305215X.2018.1554066OpenAlexW2907192689WikidataQ115198397 ScholiaQ115198397MaRDI QIDQ5059192

Xin Chen, Bertrand M. T. Lin, Erwin Pesch, Feng-Cheng Lin, Jacek Błażewicz, Zhong-Yu Wang, Richard Chia-Tung Lee, Małgorzata Sterna

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2018.1554066

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

Scheduling with competing agents, total late work and job rejection ⋮ Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work

This page was built for publication: Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work