Eberle, Franziska; Megow, Nicole; Schewior, Kevin Online throughput maximization on unrelated machines: commitment is no burden. (English) Zbl 07753161 ACM Trans. Algorithms 19, No. 1, Article No. 10, 25 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{F. Eberle} et al., ACM Trans. Algorithms 19, No. 1, Article No. 10, 25 p. (2023; Zbl 07753161) Full Text: DOI arXiv
Chen, Rubing; Yuan, Jinjiang Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines. (English) Zbl 1473.90066 Discrete Appl. Math. 304, 45-54 (2021). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{R. Chen} and \textit{J. Yuan}, Discrete Appl. Math. 304, 45--54 (2021; Zbl 1473.90066) Full Text: DOI
He, Ruyan; Yuan, Jinjiang; Ng, C. T.; Cheng, T. C. E. Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. (English) Zbl 1468.90049 J. Comb. Optim. 41, No. 2, 504-525 (2021). MSC: 90B35 PDFBibTeX XMLCite \textit{R. He} et al., J. Comb. Optim. 41, No. 2, 504--525 (2021; Zbl 1468.90049) Full Text: DOI
Hung, Hui-Chih; Lin, Bertrand M. T.; Posner, Marc E.; Wei, Jun-Min Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. (English) Zbl 1434.90059 J. Sched. 22, No. 4, 413-431 (2019). MSC: 90B35 68M20 90C11 90C59 PDFBibTeX XMLCite \textit{H.-C. Hung} et al., J. Sched. 22, No. 4, 413--431 (2019; Zbl 1434.90059) Full Text: DOI
Knust, S.; Shakhlevich, N. V.; Waldherr, S.; Weiß, C. Shop scheduling problems with pliable jobs. (English) Zbl 1432.90059 J. Sched. 22, No. 6, 635-661 (2019). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{S. Knust} et al., J. Sched. 22, No. 6, 635--661 (2019; Zbl 1432.90059) Full Text: DOI
Alidaee, Bahram; Wang, Haibo; Kethley, R. Bryan; Landram, Frank A unified view of parallel machine scheduling with interdependent processing rates. (English) Zbl 1430.90242 J. Sched. 22, No. 5, 499-515 (2019). MSC: 90B35 68M20 90C39 PDFBibTeX XMLCite \textit{B. Alidaee} et al., J. Sched. 22, No. 5, 499--515 (2019; Zbl 1430.90242) Full Text: DOI
Andrei, Ştefan; Cheng, Albert M. K.; Rădulescu, Vlad Processor bounding for an efficient non-preemptive task scheduling algorithm. (English) Zbl 1470.68036 Math. Comput. Sci. 13, No. 4, 489-515 (2019). MSC: 68M20 PDFBibTeX XMLCite \textit{Ş. Andrei} et al., Math. Comput. Sci. 13, No. 4, 489--515 (2019; Zbl 1470.68036) Full Text: DOI
Thammawichai, Mason; Kerrigan, Eric C. Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors. (English) Zbl 1425.68048 Real-Time Syst. 54, No. 1, 132-165 (2018). MSC: 68M20 PDFBibTeX XMLCite \textit{M. Thammawichai} and \textit{E. C. Kerrigan}, Real-Time Syst. 54, No. 1, 132--165 (2018; Zbl 1425.68048) Full Text: DOI arXiv
Adamu, Muminu O.; Adewumi, Aderemi O. Minimizing the weighted number of tardy jobs on multiple machines: a review. (English) Zbl 1364.90002 J. Ind. Manag. Optim. 12, No. 4, 1465-1493 (2016). MSC: 90-02 90B35 90B36 90C59 PDFBibTeX XMLCite \textit{M. O. Adamu} and \textit{A. O. Adewumi}, J. Ind. Manag. Optim. 12, No. 4, 1465--1493 (2016; Zbl 1364.90002) Full Text: DOI
Kravchenko, Svetlana A.; Werner, Frank Minimizing total tardiness on parallel machines with preemptions. (English) Zbl 1280.90059 J. Sched. 15, No. 2, 193-200 (2012); erratum ibid. 16, No. 4, 439-441 (2013). MSC: 90B35 68M20 68Q17 PDFBibTeX XMLCite \textit{S. A. Kravchenko} and \textit{F. Werner}, J. Sched. 15, No. 2, 193--200 (2012; Zbl 1280.90059) Full Text: DOI
Lushchakova, Irina N. Preemptive scheduling of two uniform parallel machines to minimize total tardiness. (English) Zbl 1244.90098 Eur. J. Oper. Res. 219, No. 1, 27-33 (2012). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{I. N. Lushchakova}, Eur. J. Oper. Res. 219, No. 1, 27--33 (2012; Zbl 1244.90098) Full Text: DOI
Kravchenko, Svetlana A.; Werner, Frank Preemptive scheduling on uniform machines to minimize mean flow time. (English) Zbl 1160.90475 Comput. Oper. Res. 36, No. 10, 2816-2821 (2009). MSC: 90B35 68M20 90C05 PDFBibTeX XMLCite \textit{S. A. Kravchenko} and \textit{F. Werner}, Comput. Oper. Res. 36, No. 10, 2816--2821 (2009; Zbl 1160.90475) Full Text: DOI
Lin, Yixun; Wang, Xiumei Necessary and sufficient conditions of optimality for some classical scheduling problems. (English) Zbl 1103.90043 Eur. J. Oper. Res. 176, No. 2, 809-818 (2007). MSC: 90B35 90C46 PDFBibTeX XMLCite \textit{Y. Lin} and \textit{X. Wang}, Eur. J. Oper. Res. 176, No. 2, 809--818 (2007; Zbl 1103.90043) Full Text: DOI
Bagchi, Tapan P.; Gupta, Jatinder N. D.; Sriskandarajah, Chelliah A review of TSP based approaches for flowshop scheduling. (English) Zbl 1079.90048 Eur. J. Oper. Res. 169, No. 3, 816-854 (2006). MSC: 90B35 90C35 PDFBibTeX XMLCite \textit{T. P. Bagchi} et al., Eur. J. Oper. Res. 169, No. 3, 816--854 (2006; Zbl 1079.90048) Full Text: DOI
Bornstein, Claudio Thomás; Alcoforado, Luciane Ferreira; Maculan, Nelson A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem. (English) Zbl 1062.90025 Eur. J. Oper. Res. 165, No. 3, 649-656 (2005). MSC: 90B35 90C35 PDFBibTeX XMLCite \textit{C. T. Bornstein} et al., Eur. J. Oper. Res. 165, No. 3, 649--656 (2005; Zbl 1062.90025) Full Text: DOI
Timkovsky, Vadim G. Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. (English) Zbl 1030.90027 Eur. J. Oper. Res. 149, No. 2, 355-376 (2003). Reviewer: Yong He (Hangzhou) MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{V. G. Timkovsky}, Eur. J. Oper. Res. 149, No. 2, 355--376 (2003; Zbl 1030.90027) Full Text: DOI
Jain, A. S.; Meeran, S. Deterministic job-shop scheduling: Past, present and future. (English) Zbl 0938.90028 Eur. J. Oper. Res. 113, No. 2, 390-434 (1999). MSC: 90B35 90-02 PDFBibTeX XMLCite \textit{A. S. Jain} and \textit{S. Meeran}, Eur. J. Oper. Res. 113, No. 2, 390--434 (1999; Zbl 0938.90028) Full Text: DOI
Hertz, Alain; Mottet, Yves; Rochat, Yves On a scheduling problem in a robotized analytical system. (English) Zbl 0846.90048 Discrete Appl. Math. 65, No. 1-3, 285-318 (1996). MSC: 90B35 PDFBibTeX XMLCite \textit{A. Hertz} et al., Discrete Appl. Math. 65, No. 1--3, 285--318 (1996; Zbl 0846.90048) Full Text: DOI
Błażewicz, Jacek; Domschke, Wolfgang; Pesch, Erwin The job shop scheduling problem: Conventional and new solution techniques. (English) Zbl 0980.90024 Eur. J. Oper. Res. 93, No. 1, 1-33 (1996). MSC: 90B35 90-02 PDFBibTeX XMLCite \textit{J. Błażewicz} et al., Eur. J. Oper. Res. 93, No. 1, 1--33 (1996; Zbl 0980.90024) Full Text: DOI
Lin, Yixun An ordered independence system and its applications to scheduling problems. (English) Zbl 0823.90104 Eur. J. Oper. Res. 74, No. 1, 188-195 (1994). Reviewer: T.M.Liebling (Lausanne) MSC: 90C27 90B35 05B35 PDFBibTeX XMLCite \textit{Y. Lin}, Eur. J. Oper. Res. 74, No. 1, 188--195 (1994; Zbl 0823.90104) Full Text: DOI
Bartal, Yair; Karloff, Howard; Rabani, Yuval A better lower bound for on-line scheduling. (English) Zbl 0807.68013 Inf. Process. Lett. 50, No. 3, 113-116 (1994). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{Y. Bartal} et al., Inf. Process. Lett. 50, No. 3, 113--116 (1994; Zbl 0807.68013) Full Text: DOI
Wagneur, E.; Sriskandarajah, C. Open shops with jobs overlap. (English) Zbl 0797.90047 Eur. J. Oper. Res. 71, No. 3, 366-378 (1993). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{E. Wagneur} and \textit{C. Sriskandarajah}, Eur. J. Oper. Res. 71, No. 3, 366--378 (1993; Zbl 0797.90047) Full Text: DOI
Kamoun, H.; Sriskandarajah, C. The complexity of scheduling jobs in repetitive manufacturing systems. (English) Zbl 0782.90053 Eur. J. Oper. Res. 70, No. 3, 350-364 (1993). MSC: 90B35 90B30 PDFBibTeX XMLCite \textit{H. Kamoun} and \textit{C. Sriskandarajah}, Eur. J. Oper. Res. 70, No. 3, 350--364 (1993; Zbl 0782.90053) Full Text: DOI
Serafini, Paolo; Speranza, M. Grazia Production scheduling problems in a textile industry. (English) Zbl 0757.90030 Eur. J. Oper. Res. 58, No. 2, 173-190 (1992). MSC: 90B30 90B35 90-08 PDFBibTeX XMLCite \textit{P. Serafini} and \textit{M. G. Speranza}, Eur. J. Oper. Res. 58, No. 2, 173--190 (1992; Zbl 0757.90030) Full Text: DOI
Du, Jianzhong; Leung, Joseph Y.-T. Minimizing the number of late jobs on unrelated machines. (English) Zbl 0734.90042 Oper. Res. Lett. 10, No. 3, 153-158 (1991). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{J. Du} and \textit{J. Y. T. Leung}, Oper. Res. Lett. 10, No. 3, 153--158 (1991; Zbl 0734.90042) Full Text: DOI
Blazewicz, Jacek; Dror, Moshe; Weglarz, Jan Mathematical programming formulations for machine scheduling: A survey. (English) Zbl 0734.90040 Eur. J. Oper. Res. 51, No. 3, 283-300 (1991). MSC: 90B35 90C60 90-02 PDFBibTeX XMLCite \textit{J. Blazewicz} et al., Eur. J. Oper. Res. 51, No. 3, 283--300 (1991; Zbl 0734.90040) Full Text: DOI
Gaudioso, Manlio; Legato, Pasquale Linear programming models for load balancing. (English) Zbl 0733.90043 Comput. Oper. Res. 18, No. 1, 59-64 (1991). Reviewer: R.Słowinski (Poznań) MSC: 90B35 90C05 90-08 90C60 PDFBibTeX XMLCite \textit{M. Gaudioso} and \textit{P. Legato}, Comput. Oper. Res. 18, No. 1, 59--64 (1991; Zbl 0733.90043) Full Text: DOI
Hall, Nicholas G.; Sethi, Suresh P.; Sriskandarajah, Chelliah On the complexity of generalized due date scheduling problems. (English) Zbl 0742.90043 Eur. J. Oper. Res. 51, No. 1, 100-109 (1991). Reviewer: H.Hamacher (Kaiserslautern) MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{N. G. Hall} et al., Eur. J. Oper. Res. 51, No. 1, 100--109 (1991; Zbl 0742.90043) Full Text: DOI
Błaźewicz, J.; Drozdowski, M.; Schmidt, G.; de Werra, Dominique Scheduling independent two processor tasks on a uniform duo-processor system. (English) Zbl 0715.90069 Discrete Appl. Math. 28, No. 1, 11-20 (1990). MSC: 90B35 68W15 90C60 PDFBibTeX XMLCite \textit{J. Błaźewicz} et al., Discrete Appl. Math. 28, No. 1, 11--20 (1990; Zbl 0715.90069) Full Text: DOI
de Werra, Dominique Almost nonpreemptive schedules. (English) Zbl 0709.90059 Ann. Oper. Res. 26, 243-256 (1990). MSC: 90B35 90C35 PDFBibTeX XMLCite \textit{D. de Werra}, Ann. Oper. Res. 26, 243--256 (1990; Zbl 0709.90059) Full Text: DOI
Du, Jianzhong; Leung, Joseph Y.-T.; Young, Gilbert H. Minimizing mean flow time with release time constraint. (English) Zbl 0701.68008 Theor. Comput. Sci. 75, No. 3, 347-355 (1990). MSC: 68M20 68Q25 90B35 PDFBibTeX XMLCite \textit{J. Du} et al., Theor. Comput. Sci. 75, No. 3, 347--355 (1990; Zbl 0701.68008) Full Text: DOI
Sterbin Gottlieb, Elsie; Rao, M. R. The generalized assignment problem: Valid inequalities and facets. (English) Zbl 0694.90071 Math. Program., Ser. A 46, No. 1, 31-52 (1990). Reviewer: H.T.Lau MSC: 90C09 52Bxx 90C05 PDFBibTeX XMLCite \textit{E. Sterbin Gottlieb} and \textit{M. R. Rao}, Math. Program. 46, No. 1 (A), 31--52 (1990; Zbl 0694.90071) Full Text: DOI
Błażewicz, J.; Finke, G.; Haupt, R.; Schmidt, G. New trends in machine scheduling. (English) Zbl 0652.90058 Eur. J. Oper. Res. 37, No. 3, 303-317 (1988). MSC: 90B35 90-02 PDFBibTeX XMLCite \textit{J. Błażewicz} et al., Eur. J. Oper. Res. 37, No. 3, 303--317 (1988; Zbl 0652.90058) Full Text: DOI
Lenstra, J. K.; Rinnooy Kan, A. H. G. New directions in scheduling theory. (English) Zbl 0528.90047 Oper. Res. Lett. 2, 255-259 (1984). MSC: 90B35 90-02 68Q25 68M20 PDFBibTeX XMLCite \textit{J. K. Lenstra} and \textit{A. H. G. Rinnooy Kan}, Oper. Res. Lett. 2, 255--259 (1984; Zbl 0528.90047) Full Text: DOI Link