The following publications are possibly variants of this publication:
- Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early WorkMalgorzata Sterna, Kateryna Czerniachowska. jota, 174(3):927-944, 2017. [doi]
- Alternative algorithms for identical machines scheduling to maximize total early work with a common due dateXin Chen 0057, Xuefeng Shen, Mikhail Y. Kovalyov, Malgorzata Sterna, Jacek Blazewicz. candie, 171:108386, 2022. [doi]
- Two-machine flow shop scheduling with a common due date to maximize total early workXin Chen 0032, Qian Miao, Bertrand M. T. Lin, Malgorzata Sterna, Jacek Blazewicz. eor, 300(2):504-511, 2022. [doi]
- Semi-online scheduling on two identical machines with a common due date to maximize total early workXin Chen, Sergey Kovalev, Yuqing Liu, Malgorzata Sterna, Isabelle Chalamon, Jacek Blazewicz. DAM, 290:71-78, 2021. [doi]