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

DOI10.1080/0305215X.2018.1554066MaRDI QIDQ5059192zbMATH OpenOpenAlexWikidataFDO

Authors Jacek Blazewicz, Xin Chen, B. M. T. Lin, Feng-Cheng Lin, Erwin Pesch, R. C. T. Lee, Małgorzata Sterna, Zhongyu Wang

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)

Cited in

(4)

• Two-machine flow shop scheduling with a common due date to maximize total early work
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059192)