Khramova, Antonina P.; Chernykh, Ilya A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing. (English) Zbl 1479.90098 J. Sched. 24, No. 4, 405-412 (2021). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{A. P. Khramova} and \textit{I. Chernykh}, J. Sched. 24, No. 4, 405--412 (2021; Zbl 1479.90098) Full Text: DOI
Shabtay, Dvir; Bensoussan, Yaron Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. (English) Zbl 1280.90070 J. Sched. 15, No. 1, 39-47 (2012). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{D. Shabtay} and \textit{Y. Bensoussan}, J. Sched. 15, No. 1, 39--47 (2012; Zbl 1280.90070) Full Text: DOI
Baruah, Sanjoy; Pruhs, Kirk Open problems in real-time scheduling. (English) Zbl 1208.90054 J. Sched. 13, No. 6, 577-582 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{S. Baruah} and \textit{K. Pruhs}, J. Sched. 13, No. 6, 577--582 (2010; Zbl 1208.90054) Full Text: DOI
Schuurman, Petra; Woeginger, Gerhard J. Polynomial time approximation algorithms for machine scheduling: Ten open problems. (English) Zbl 0938.90032 J. Sched. 2, No. 5, 203-213 (1999). MSC: 90B35 90-02 PDFBibTeX XMLCite \textit{P. Schuurman} and \textit{G. J. Woeginger}, J. Sched. 2, No. 5, 203--213 (1999; Zbl 0938.90032) Full Text: DOI