1. Гордон В.С., Смотряев В.Н., Тарасевич А.А. Построение оптимальных расписаний при назначении директивных сроков // Информатика. – 2004. – № 1. – С. 17–27.

2. Гордон В.С., Смотряев В.Н., Тарасевич А.А. Задачи построения оптимальных расписаний с назначаемыми директивными сроками // Докл. Первого научного семинара «Танаевские чтения». – Мн.: ОИПИ НАН Беларуси, 2003. – С. 57–62.

3. Gordon V.S., Proth J.-M., Strusevich V.A. Scheduling with due date assignment // Handbook of scheduling: algorithms, models and complexity analysis. – Boca Raton: CRC Press, 2004. – Ch. 21. – P. 21-1 – 21-22.

4. Sequencing and scheduling: Algorithms and complexity / E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys // Logistics of Production and Inventory. Handbooks in Operations Research and Management Science. – Amsterdam: North-Holland, 1993. – Vol.4. – P. 445–522.

5. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling prob-lems // Annals of Discrete Mathematics. – 1977. – № 1. – P. 343–362.

6. Panwalkar S.S., Smith M.L., Seidmann A. Common due date assignment to minimize total penalty for the one machine scheduling problem // Operations Research. – 1982. – № 30. – P. 391–399.

7. Cheng T.C.E., Chen Z-L., Shakhlevich N.V. Common due date assignment and scheduling with ready times // Computers & Operations Research. – 2002. – № 29. – P. 1957–1967.

8. Hertz A., Taillard E., de Werra D. Tabu Search // Local Search in Combinatorial Optimization. – Wiley: Chichester, 1997. – P. 121–136.

9. Biskup D., Feldmann M. Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates // Computers & Operations Research – 2001. – № 28. – P. 787–801.