Fotakis, Dimitris; Matuschke, Jannik; Papadigenopoulos, Orestis Malleable scheduling beyond identical machines. (English) Zbl 1527.90095 J. Sched. 26, No. 5, 425-442 (2023). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{D. Fotakis} et al., J. Sched. 26, No. 5, 425--442 (2023; Zbl 1527.90095) Full Text: DOI
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
Wu, Fangfang; Jiang, Zhongyi; Zhang, Run; Zhang, Xiandong Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms. (English) Zbl 1520.90133 J. Sched. 26, No. 4, 383-398 (2023). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{F. Wu} et al., J. Sched. 26, No. 4, 383--398 (2023; Zbl 1520.90133) Full Text: DOI
Jansen, Klaus; Kahler, Kai On the complexity of scheduling problems with a fixed number of parallel identical machines. (English) Zbl 07726604 Gąsieniec, Leszek (ed.), SOFSEM 2023: theory and practice of computer science. 48th international conference on current trends in theory and practice of computer science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13878, 192-206 (2023). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{K. Kahler}, Lect. Notes Comput. Sci. 13878, 192--206 (2023; Zbl 07726604) Full Text: DOI arXiv
Li, Shi-Sheng; Chen, Ren-Xia Competitive two-agent scheduling with release dates and preemption on a single machine. (English) Zbl 1518.90028 J. Sched. 26, No. 3, 227-249 (2023). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{S.-S. Li} and \textit{R.-X. Chen}, J. Sched. 26, No. 3, 227--249 (2023; Zbl 1518.90028) Full Text: DOI
Fagnon, Vincent; Lucarelli, Giorgio; Mommessin, Clément; Trystram, Denis Two-agent scheduling with resource augmentation on multiple machines. (English) Zbl 1512.68042 Cano, José (ed.) et al., Euro-Par 2022: parallel processing. 28th international conference on parallel and distributed computing, Glasgow, UK, August 22–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13440, 253-267 (2022). MSC: 68M20 68W27 90B35 PDFBibTeX XMLCite \textit{V. Fagnon} et al., Lect. Notes Comput. Sci. 13440, 253--267 (2022; Zbl 1512.68042) Full Text: DOI
Mosheiov, Gur; Oron, Daniel; Shabtay, Dvir On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. (English) Zbl 1501.90030 J. Sched. 25, No. 5, 577-587 (2022). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{G. Mosheiov} et al., J. Sched. 25, No. 5, 577--587 (2022; Zbl 1501.90030) Full Text: DOI
Moselely, Benjamin; Zhang, Ruilong; Zhao, Shanjiawen Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models. (English) Zbl 07605952 Theor. Comput. Sci. 938, 24-38 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{B. Moselely} et al., Theor. Comput. Sci. 938, 24--38 (2022; Zbl 07605952) Full Text: DOI
Fotakis, Dimitris; Matuschke, Jannik; Papadigenopoulos, Orestis A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds. (English) Zbl 1497.90087 Aardal, Karen (ed.) et al., Integer programming and combinatorial optimization. 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13265, 237-250 (2022). MSC: 90B35 68M20 68W25 PDFBibTeX XMLCite \textit{D. Fotakis} et al., Lect. Notes Comput. Sci. 13265, 237--250 (2022; Zbl 1497.90087) Full Text: DOI arXiv
Kononov, Alexander; Zakharova, Yulia Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion. (English) Zbl 1495.90076 J. Glob. Optim. 83, No. 3, 539-564 (2022). MSC: 90B35 68M20 68Q25 68W25 90C59 PDFBibTeX XMLCite \textit{A. Kononov} and \textit{Y. Zakharova}, J. Glob. Optim. 83, No. 3, 539--564 (2022; Zbl 1495.90076) Full Text: DOI
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir Scheduling lower bounds via AND subset sum. (English) Zbl 1483.68142 J. Comput. Syst. Sci. 127, 29-40 (2022). MSC: 68Q17 90B35 90C27 PDFBibTeX XMLCite \textit{A. Abboud} et al., J. Comput. Syst. Sci. 127, 29--40 (2022; Zbl 1483.68142) Full Text: DOI arXiv
Yu, Xue; Lu, Lingfa; Zhang, Liqi Single machine scheduling with rejection and generalized parameters. (English) Zbl 07550528 Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 234-246 (2021). MSC: 68T20 90C27 PDFBibTeX XMLCite \textit{X. Yu} et al., Lect. Notes Comput. Sci. 13135, 234--246 (2021; Zbl 07550528) Full Text: DOI
Chen, Xin; Kovalev, Sergey; Sterna, Małgorzata; Błażewicz, Jacek Mirror scheduling problems with early work and late work criteria. (English) Zbl 1480.90129 J. Sched. 24, No. 5, 483-487 (2021). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{X. Chen} et al., J. Sched. 24, No. 5, 483--487 (2021; Zbl 1480.90129) Full Text: DOI
Mor, Baruch; Mosheiov, Gur; Shabtay, Dvir Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. (English) Zbl 1480.90136 J. Sched. 24, No. 6, 553-567 (2021). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{B. Mor} et al., J. Sched. 24, No. 6, 553--567 (2021; Zbl 1480.90136) Full Text: DOI
Happach, Felix Makespan minimization with OR-precedence constraints. (English) Zbl 1479.90091 J. Sched. 24, No. 3, 319-328 (2021). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{F. Happach}, J. Sched. 24, No. 3, 319--328 (2021; Zbl 1479.90091) Full Text: DOI arXiv
Koulamas, Christos; Steiner, George New results for scheduling to minimize tardiness on one machine with rejection and related problems. (English) Zbl 1479.90099 J. Sched. 24, No. 1, 27-34 (2021). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{C. Koulamas} and \textit{G. Steiner}, J. Sched. 24, No. 1, 27--34 (2021; Zbl 1479.90099) Full Text: DOI
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
Mosheiov, Gur; Oron, Daniel; Shabtay, Dvir Minimizing total late work on a single machine with generalized due-dates. (English) Zbl 1487.90309 Eur. J. Oper. Res. 293, No. 3, 837-846 (2021). MSC: 90B35 68M20 90C39 PDFBibTeX XMLCite \textit{G. Mosheiov} et al., Eur. J. Oper. Res. 293, No. 3, 837--846 (2021; Zbl 1487.90309) Full Text: DOI
Jiang, Xiaojuan; Lee, Kangbok; Pinedo, Michael L. Ideal schedules in parallel machine settings. (English) Zbl 1487.90297 Eur. J. Oper. Res. 290, No. 2, 422-434 (2021). MSC: 90B35 68M20 68Q25 PDFBibTeX XMLCite \textit{X. Jiang} et al., Eur. J. Oper. Res. 290, No. 2, 422--434 (2021; Zbl 1487.90297) Full Text: DOI
Jansen, Klaus; Sinnen, Oliver; Wang, Huijun An EPTAS for scheduling fork-join graphs with communication delay. (English) Zbl 1497.68065 Theor. Comput. Sci. 861, 66-79 (2021). MSC: 68M20 68R10 68W25 PDFBibTeX XMLCite \textit{K. Jansen} et al., Theor. Comput. Sci. 861, 66--79 (2021; Zbl 1497.68065) Full Text: DOI
Munier Kordon, Alix A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows. (English) Zbl 1462.68016 Discrete Appl. Math. 290, 1-6 (2021). MSC: 68M20 68Q27 90B35 90C39 PDFBibTeX XMLCite \textit{A. Munier Kordon}, Discrete Appl. Math. 290, 1--6 (2021; Zbl 1462.68016) Full Text: DOI
Henning, Sören; Jansen, Klaus; Rau, Malin; Schmarje, Lars Complexity and inapproximability results for parallel task scheduling and strip packing. (English) Zbl 1477.68119 Theory Comput. Syst. 64, No. 1, 120-140 (2020). Reviewer: Roberto Solis-Oba (London) MSC: 68Q17 68W25 90B35 90C27 PDFBibTeX XMLCite \textit{S. Henning} et al., Theory Comput. Syst. 64, No. 1, 120--140 (2020; Zbl 1477.68119) Full Text: DOI arXiv
Fotakis, Dimitris; Matuschke, Jannik; Papadigenopoulos, Orestis Malleable scheduling beyond identical machines. (English) Zbl 07650084 Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 17, 14 p. (2019). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{D. Fotakis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 145, Article 17, 14 p. (2019; Zbl 07650084) Full Text: DOI arXiv
Chen, Rubing; Yuan, Jinjiang Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. (English) Zbl 1430.90251 J. Sched. 22, No. 5, 595-601 (2019). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{R. Chen} and \textit{J. Yuan}, J. Sched. 22, No. 5, 595--601 (2019; Zbl 1430.90251) Full Text: DOI
Kasperski, Adam; Zieliński, Paweł Risk-averse single machine scheduling: complexity and approximation. (English) Zbl 1430.90270 J. Sched. 22, No. 5, 567-580 (2019). MSC: 90B35 68M20 90C59 PDFBibTeX XMLCite \textit{A. Kasperski} and \textit{P. Zieliński}, J. Sched. 22, No. 5, 567--580 (2019; Zbl 1430.90270) Full Text: DOI arXiv
Shang, Lei; Garraffa, Michele; Della Croce, Federico; T’kindt, Vincent Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem. (English) Zbl 1443.68222 Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 28, 12 p. (2018). MSC: 68W40 68P05 90B35 PDFBibTeX XMLCite \textit{L. Shang} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 28, 12 p. (2018; Zbl 1443.68222) Full Text: DOI
Prot, D.; Bellenguez-Morineau, O. A survey on how the structure of precedence constraints may change the complexity class of scheduling problems. (English) Zbl 1406.90006 J. Sched. 21, No. 1, 3-16 (2018). MSC: 90-02 90B35 68M20 PDFBibTeX XMLCite \textit{D. Prot} and \textit{O. Bellenguez-Morineau}, J. Sched. 21, No. 1, 3--16 (2018; Zbl 1406.90006) Full Text: DOI arXiv
Garraffa, Michele; Shang, Lei; Della Croce, Federico; T’kindt, Vincent An exact exponential branch-and-merge algorithm for the single machine total tardiness problem. (English) Zbl 1407.90153 Theor. Comput. Sci. 745, 133-149 (2018). MSC: 90B35 68Q25 90C39 PDFBibTeX XMLCite \textit{M. Garraffa} et al., Theor. Comput. Sci. 745, 133--149 (2018; Zbl 1407.90153) Full Text: DOI HAL
Mnich, Matthias; van Bevern, René Parameterized complexity of machine scheduling: 15 open problems. (English) Zbl 1458.90333 Comput. Oper. Res. 100, 254-261 (2018). MSC: 90B35 68Q25 68M20 68Q17 90C60 PDFBibTeX XMLCite \textit{M. Mnich} and \textit{R. van Bevern}, Comput. Oper. Res. 100, 254--261 (2018; Zbl 1458.90333) Full Text: DOI arXiv
Jaehn, Florian; Sedding, Helmut A. Scheduling with time-dependent discrepancy times. (English) Zbl 1386.90057 J. Sched. 19, No. 6, 737-757 (2016). MSC: 90B35 68M20 90C57 90C59 PDFBibTeX XMLCite \textit{F. Jaehn} and \textit{H. A. Sedding}, J. Sched. 19, No. 6, 737--757 (2016; Zbl 1386.90057) Full Text: DOI
Jansen, K.; Land, F.; Land, K. Bounding the running time of algorithms for scheduling and packing problems. (English) Zbl 1336.68100 SIAM J. Discrete Math. 30, No. 1, 343-366 (2016). MSC: 68Q17 68W25 90B35 90C27 PDFBibTeX XMLCite \textit{K. Jansen} et al., SIAM J. Discrete Math. 30, No. 1, 343--366 (2016; Zbl 1336.68100) Full Text: DOI Link
Waldherr, Stefan; Knust, Sigrid Complexity results for flow shop problems with synchronous movement. (English) Zbl 1341.90055 Eur. J. Oper. Res. 242, No. 1, 34-44 (2015). MSC: 90B35 90C60 68Q17 68Q25 PDFBibTeX XMLCite \textit{S. Waldherr} and \textit{S. Knust}, Eur. J. Oper. Res. 242, No. 1, 34--44 (2015; Zbl 1341.90055) Full Text: DOI
Kell, Nathaniel; Havill, Jessen Improved upper bounds for online malleable job scheduling. (English) Zbl 1328.90053 J. Sched. 18, No. 4, 393-410 (2015). MSC: 90B35 68M20 68W27 68Q10 PDFBibTeX XMLCite \textit{N. Kell} and \textit{J. Havill}, J. Sched. 18, No. 4, 393--410 (2015; Zbl 1328.90053) Full Text: DOI
Waldherr, Stefan; Poppenborg, Jens; Knust, Sigrid The bottleneck transportation problem with auxiliary resources. (English) Zbl 1327.90021 4OR 13, No. 3, 279-292 (2015). MSC: 90B06 68Q25 PDFBibTeX XMLCite \textit{S. Waldherr} et al., 4OR 13, No. 3, 279--292 (2015; Zbl 1327.90021) Full Text: DOI
Schalekamp, Frans; Sitters, René; van der Ster, Suzanne; Stougie, Leen; Verdugo, Víctor; van Zuylen, Anke Split scheduling with uniform setup times. (English) Zbl 1312.90023 J. Sched. 18, No. 2, 119-129 (2015). MSC: 90B35 68M20 65Y05 68W25 PDFBibTeX XMLCite \textit{F. Schalekamp} et al., J. Sched. 18, No. 2, 119--129 (2015; Zbl 1312.90023) Full Text: DOI arXiv
Coffman, E. G. jun.; Ng, C. T.; Timkovsky, V. G. How small are shifts required in optimal preemptive schedules? (English) Zbl 1312.65235 J. Sched. 18, No. 2, 155-163 (2015). MSC: 65Y05 90B35 68M20 PDFBibTeX XMLCite \textit{E. G. Coffman jun.} et al., J. Sched. 18, No. 2, 155--163 (2015; Zbl 1312.65235) Full Text: DOI
Thevenin, Simon; Zufferey, Nicolas; Widmer, Marino Metaheuristics for a scheduling problem with rejection and tardiness penalties. (English) Zbl 1310.90056 J. Sched. 18, No. 1, 89-105 (2015). MSC: 90B36 68M20 90C59 PDFBibTeX XMLCite \textit{S. Thevenin} et al., J. Sched. 18, No. 1, 89--105 (2015; Zbl 1310.90056) Full Text: DOI Link
Vásquez, Óscar C. On the complexity of the single machine scheduling problem minimizing total weighted delay penalty. (English) Zbl 1408.90143 Oper. Res. Lett. 42, No. 5, 343-347 (2014). MSC: 90B35 68Q25 90C60 PDFBibTeX XMLCite \textit{Ó. C. Vásquez}, Oper. Res. Lett. 42, No. 5, 343--347 (2014; Zbl 1408.90143) Full Text: DOI
Mascia, Franco; López-Ibáñez, Manuel; Dubois-Lacoste, Jérémie; Stützle, Thomas Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools. (English) Zbl 1348.68230 Comput. Oper. Res. 51, 190-199 (2014). MSC: 68T20 90B35 90C59 PDFBibTeX XMLCite \textit{F. Mascia} et al., Comput. Oper. Res. 51, 190--199 (2014; Zbl 1348.68230) Full Text: DOI
He, Cheng; Lin, Hao; Lin, Yixun; Dou, Junmei Minimizing total completion time for preemptive scheduling with release dates and deadline constraints. (English) Zbl 1328.90050 Found. Comput. Decis. Sci. 39, No. 1, 17-26 (2014). MSC: 90B35 68Q25 90C60 PDFBibTeX XMLCite \textit{C. He} et al., Found. Comput. Decis. Sci. 39, No. 1, 17--26 (2014; Zbl 1328.90050) Full Text: DOI
Kao, Shih-Hung; Hwang, Tzonelih Multiparty controlled quantum secure direct communication based on quantum search algorithm. (English) Zbl 1303.81059 Quantum Inf. Process. 12, No. 12, 3791-3805 (2013). MSC: 81P94 94A60 81P68 68P10 81P40 PDFBibTeX XMLCite \textit{S.-H. Kao} and \textit{T. Hwang}, Quantum Inf. Process. 12, No. 12, 3791--3805 (2013; Zbl 1303.81059) 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
Liu, Xiaocheng; Chen, Bin; Qiu, Xiaogang; Cai, Ying; Huang, Kedi Scheduling parallel jobs using migration and consolidation in the cloud. (English) Zbl 1264.68037 Math. Probl. Eng. 2012, Article ID 695757, 18 p. (2012). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{X. Liu} et al., Math. Probl. Eng. 2012, Article ID 695757, 18 p. (2012; Zbl 1264.68037) Full Text: DOI
Lamothe, Jacques; Marmier, Francois; Dupuy, Matthieu; Gaborit, Paul; Dupont, Lionel Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints. (English) Zbl 1251.90161 Comput. Oper. Res. 39, No. 6, 1236-1244 (2012). MSC: 90B35 90C59 68M20 PDFBibTeX XMLCite \textit{J. Lamothe} et al., Comput. Oper. Res. 39, No. 6, 1236--1244 (2012; Zbl 1251.90161) Full Text: DOI arXiv
Sioud, A.; Gravel, Marc; Gagné, Caroline A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times. (English) Zbl 1251.90189 Comput. Oper. Res. 39, No. 10, 2415-2424 (2012). MSC: 90B35 90C59 68T05 PDFBibTeX XMLCite \textit{A. Sioud} et al., Comput. Oper. Res. 39, No. 10, 2415--2424 (2012; Zbl 1251.90189) Full Text: DOI
Yuan, Junling; Li, Wenhua; Yuan, Jinjiang A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints. (English) Zbl 1252.68052 Theor. Comput. Sci. 457, 174-180 (2012). MSC: 68M20 68W27 90B35 PDFBibTeX XMLCite \textit{J. Yuan} et al., Theor. Comput. Sci. 457, 174--180 (2012; Zbl 1252.68052) Full Text: DOI
Jansen, Klaus; Zhang, Hu Scheduling malleable tasks with precedence constraints. (English) Zbl 1238.68041 J. Comput. Syst. Sci. 78, No. 1, 245-259 (2012). MSC: 68M20 68W25 90B35 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{H. Zhang}, J. Comput. Syst. Sci. 78, No. 1, 245--259 (2012; Zbl 1238.68041) Full Text: DOI
Dubois-Lacoste, Jérémie; López-Ibáñez, Manuel; Stützle, Thomas Improving the anytime behavior of two-phase local search. (English) Zbl 1234.68362 Ann. Math. Artif. Intell. 61, No. 2, 125-154 (2011). MSC: 68T20 PDFBibTeX XMLCite \textit{J. Dubois-Lacoste} et al., Ann. Math. Artif. Intell. 61, No. 2, 125--154 (2011; Zbl 1234.68362) Full Text: DOI Link
Gafarov, Evgeny R.; Lazarev, Alexander A.; Werner, Frank Single machine scheduling problems with financial resource constraints: some complexity results and properties. (English) Zbl 1229.90059 Math. Soc. Sci. 62, No. 1, 7-13 (2011). Reviewer: Sigrid Knust (Osnabrück) MSC: 90B35 91B32 68Q25 PDFBibTeX XMLCite \textit{E. R. Gafarov} et al., Math. Soc. Sci. 62, No. 1, 7--13 (2011; Zbl 1229.90059) Full Text: DOI
Choi, Byung-Soo; Braunstein, Samuel L. Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights. (English) Zbl 1216.81047 Quantum Inf. Process. 10, No. 2, 177-188 (2011). MSC: 81P68 68Q12 68P10 PDFBibTeX XMLCite \textit{B.-S. Choi} and \textit{S. L. Braunstein}, Quantum Inf. Process. 10, No. 2, 177--188 (2011; Zbl 1216.81047) Full Text: DOI Link
Ye, Deshi; Han, Xin; Zhang, Guochuan Online multiple-strip packing. (English) Zbl 1207.90086 Theor. Comput. Sci. 412, No. 3, 233-239 (2011). MSC: 90C27 68W27 90B35 PDFBibTeX XMLCite \textit{D. Ye} et al., Theor. Comput. Sci. 412, No. 3, 233--239 (2011; Zbl 1207.90086) Full Text: DOI
Gafarov, E. R.; Lazarev, A. A.; Werner, F. Algorithms for some maximization scheduling problems on a single machine. (English. Russian original) Zbl 1203.93126 Autom. Remote Control 71, No. 10, 2070-2084 (2010); translation from Avtom. Telemekh. 2010, No. 10, 63-79 (2010). MSC: 93C83 68M20 49N90 PDFBibTeX XMLCite \textit{E. R. Gafarov} et al., Autom. Remote Control 71, No. 10, 2070--2084 (2010; Zbl 1203.93126); translation from Avtom. Telemekh. 2010, No. 10, 63--79 (2010) Full Text: DOI
Bock, Stefan; Pinedo, Michael A decomposition scheme for single stage scheduling problems. (English) Zbl 1193.90093 J. Sched. 13, No. 3, 203-212 (2010). MSC: 90B35 90C60 68Q25 PDFBibTeX XMLCite \textit{S. Bock} and \textit{M. Pinedo}, J. Sched. 13, No. 3, 203--212 (2010; Zbl 1193.90093) Full Text: DOI
Figueira, J. R.; Liefooghe, A.; Talbi, E.-G.; Wierzbicki, A. P. A parallel multiple reference point approach for multi-objective optimization. (English) Zbl 1188.90237 Eur. J. Oper. Res. 205, No. 2, 390-400 (2010). MSC: 90C29 68W10 90C59 90B35 PDFBibTeX XMLCite \textit{J. R. Figueira} et al., Eur. J. Oper. Res. 205, No. 2, 390--400 (2010; Zbl 1188.90237) Full Text: DOI HAL
Zhang, Liqi; Lu, Lingfa; Yuan, Jinjiang Single-machine scheduling under the job rejection constraint. (English) Zbl 1192.68111 Theor. Comput. Sci. 411, No. 16-18, 1877-1882 (2010). MSC: 68M20 PDFBibTeX XMLCite \textit{L. Zhang} et al., Theor. Comput. Sci. 411, No. 16--18, 1877--1882 (2010; Zbl 1192.68111) Full Text: DOI
Jansen, Klaus; Solis-Oba, Roberto Approximation schemes for scheduling jobs with chain precedence constraints. (English) Zbl 1186.68067 Int. J. Found. Comput. Sci. 21, No. 1, 27-49 (2010). MSC: 68M20 68W25 68Q25 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{R. Solis-Oba}, Int. J. Found. Comput. Sci. 21, No. 1, 27--49 (2010; Zbl 1186.68067) Full Text: DOI
Lazarev, Alexander A.; Werner, Frank Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem. (English) Zbl 1198.68152 Math. Comput. Modelling 49, No. 9-10, 2061-2072 (2009). MSC: 68Q17 90B35 PDFBibTeX XMLCite \textit{A. A. Lazarev} and \textit{F. Werner}, Math. Comput. Modelling 49, No. 9--10, 2061--2072 (2009; Zbl 1198.68152) Full Text: DOI
Karakostas, George; Kolliopoulos, Stavros G.; Wang, Jing An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates. (English) Zbl 1248.90050 Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 238-248 (2009). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{G. Karakostas} et al., Lect. Notes Comput. Sci. 5609, 238--248 (2009; Zbl 1248.90050) Full Text: DOI Link
Rom, Walter O.; Slotnick, Susan A. Order acceptance using genetic algorithms. (English) Zbl 1179.90151 Comput. Oper. Res. 36, No. 6, 1758-1767 (2009). MSC: 90B35 90C59 68T99 PDFBibTeX XMLCite \textit{W. O. Rom} and \textit{S. A. Slotnick}, Comput. Oper. Res. 36, No. 6, 1758--1767 (2009; Zbl 1179.90151) Full Text: DOI Link
Janiak, Adam; Rudek, Radosław The learning effect: getting to the core of the problem. (English) Zbl 1184.68405 Inf. Process. Lett. 103, No. 5, 183-187 (2007). MSC: 68T05 68M20 68Q17 PDFBibTeX XMLCite \textit{A. Janiak} and \textit{R. Rudek}, Inf. Process. Lett. 103, No. 5, 183--187 (2007; Zbl 1184.68405) Full Text: DOI
Ye, Deshi; Zhang, Guochuan Maximizing the throughput of parallel jobs on hypercubes. (English) Zbl 1184.68063 Inf. Process. Lett. 102, No. 6, 259-263 (2007). MSC: 68M10 68M20 PDFBibTeX XMLCite \textit{D. Ye} and \textit{G. Zhang}, Inf. Process. Lett. 102, No. 6, 259--263 (2007; Zbl 1184.68063) Full Text: DOI
Shabtay, Dvir; Steiner, George A survey of scheduling with controllable processing times. (English) Zbl 1119.90022 Discrete Appl. Math. 155, No. 13, 1643-1666 (2007). MSC: 90B35 68M20 90-02 PDFBibTeX XMLCite \textit{D. Shabtay} and \textit{G. Steiner}, Discrete Appl. Math. 155, No. 13, 1643--1666 (2007; Zbl 1119.90022) Full Text: DOI
Huo, Yumei; Leung, J. Y.-T.; Zhao, Hairong Complexity of two dual criteria scheduling problems. (English) Zbl 1149.90342 Oper. Res. Lett. 35, No. 2, 211-220 (2007). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{Y. Huo} et al., Oper. Res. Lett. 35, No. 2, 211--220 (2007; Zbl 1149.90342) Full Text: DOI
Leonardi, Stefano; Raz, Danny Approximating total flow time on parallel machines. (English) Zbl 1120.90022 J. Comput. Syst. Sci. 73, No. 6, 875-891 (2007). MSC: 90B35 68Q17 68W25 68M20 68W20 PDFBibTeX XMLCite \textit{S. Leonardi} and \textit{D. Raz}, J. Comput. Syst. Sci. 73, No. 6, 875--891 (2007; Zbl 1120.90022) Full Text: DOI
Ye, Deshi; Zhang, Guochuan On-line scheduling mesh jobs with dependencies. (English) Zbl 1108.68024 Theor. Comput. Sci. 372, No. 1, 94-102 (2007). MSC: 68M20 68W05 PDFBibTeX XMLCite \textit{D. Ye} and \textit{G. Zhang}, Theor. Comput. Sci. 372, No. 1, 94--102 (2007; Zbl 1108.68024) Full Text: DOI
Lemaire, P.; Finke, G.; Brauner, N. Models and complexity of multibin packing problems. (English) Zbl 1156.90432 J. Math. Model. Algorithms 5, No. 3, 353-370 (2006). MSC: 90C27 68W25 90C60 PDFBibTeX XMLCite \textit{P. Lemaire} et al., J. Math. Model. Algorithms 5, No. 3, 353--370 (2006; Zbl 1156.90432) Full Text: DOI
Kellerer, Hans; Strusevich, Vitaly A. A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. (English) Zbl 1140.90026 Theor. Comput. Sci. 369, No. 1-3, 230-238 (2006). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{H. Kellerer} and \textit{V. A. Strusevich}, Theor. Comput. Sci. 369, No. 1--3, 230--238 (2006; Zbl 1140.90026) Full Text: DOI
Decker, T.; Lücking, T.; Monien, B. A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks. (English) Zbl 1097.68148 Theor. Comput. Sci. 361, No. 2-3, 226-240 (2006). MSC: 68W25 68M20 PDFBibTeX XMLCite \textit{T. Decker} et al., Theor. Comput. Sci. 361, No. 2--3, 226--240 (2006; Zbl 1097.68148) Full Text: DOI
Kolliopoulos, Stavros G.; Steiner, George Approximation algorithms for minimizing the total weighted tardiness on a single machine. (English) Zbl 1088.68024 Theor. Comput. Sci. 355, No. 3, 261-273 (2006). MSC: 68M20 68W25 PDFBibTeX XMLCite \textit{S. G. Kolliopoulos} and \textit{G. Steiner}, Theor. Comput. Sci. 355, No. 3, 261--273 (2006; Zbl 1088.68024) Full Text: DOI
Leung, Joseph Y.-T.; Li, Haibing; Pinedo, Michael Order scheduling in an environment with dedicated resources in parallel. (English) Zbl 1123.90030 J. Sched. 8, No. 5, 355-386 (2005). MSC: 90B35 68M20 90C59 PDFBibTeX XMLCite \textit{J. Y. T. Leung} et al., J. Sched. 8, No. 5, 355--386 (2005; Zbl 1123.90030) Full Text: DOI
Tian, Z. J.; Ng, C. T.; Cheng, T. C. E. On the single machine total tardiness problem. (English) Zbl 1062.90030 Eur. J. Oper. Res. 165, No. 3, 843-846 (2005). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{Z. J. Tian} et al., Eur. J. Oper. Res. 165, No. 3, 843--846 (2005; Zbl 1062.90030) Full Text: DOI
Bilge, Ümit; Kıraç, Furkan; Kurtulan, Müjde; Pekgün, Pelin A tabu search algorithm for parallel machine total tardiness problem. (English) Zbl 1057.90516 Comput. Oper. Res. 31, No. 3, 397-414 (2004). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{Ü. Bilge} et al., Comput. Oper. Res. 31, No. 3, 397--414 (2004; Zbl 1057.90516) Full Text: DOI
Mosheiov, Gur; Oron, Daniel A note on the SPT heuristic for solving scheduling problems with generalized due dates. (English) Zbl 1048.90107 Comput. Oper. Res. 31, No. 5, 645-655 (2004). MSC: 90B35 90C59 68M20 PDFBibTeX XMLCite \textit{G. Mosheiov} and \textit{D. Oron}, Comput. Oper. Res. 31, No. 5, 645--655 (2004; Zbl 1048.90107) Full Text: DOI
Lann, Avital; Mosheiov, Gur A note on the maximum number of on-time jobs on parallel identical machines. (English) Zbl 1039.90016 Comput. Oper. Res. 30, No. 11, 1745-1749 (2003). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{A. Lann} and \textit{G. Mosheiov}, Comput. Oper. Res. 30, No. 11, 1745--1749 (2003; Zbl 1039.90016) Full Text: DOI
Oǧuz, C.; Ercan, M. Fikret; Cheng, T. C. Edwin; Fung, Y. F. Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (English) Zbl 1059.90072 Eur. J. Oper. Res. 149, No. 2, 390-403 (2003). Reviewer: Jacek Błazewicz (Poznań) MSC: 90B35 90C59 68M20 PDFBibTeX XMLCite \textit{C. Oǧuz} et al., Eur. J. Oper. Res. 149, No. 2, 390--403 (2003; Zbl 1059.90072) 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
Lepère, Renaud; Trystram, Denis; Woeginger, Gerhard J. Approximation algorithms for scheduling malleable tasks under precedence constraints. (English) Zbl 1066.68010 Int. J. Found. Comput. Sci. 13, No. 4, 613-627 (2002). MSC: 68M20 68W25 90B35 PDFBibTeX XMLCite \textit{R. Lepère} et al., Int. J. Found. Comput. Sci. 13, No. 4, 613--627 (2002; Zbl 1066.68010) Full Text: DOI
Błażewicz, Jacek; Dell’Olmo, Paolo; Drozdowski, Maciej Scheduling multiprocessor tasks on two parallel processors. (English) Zbl 1024.68007 RAIRO, Oper. Res. 36, No. 1, 37-51 (2002). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{J. Błażewicz} et al., RAIRO, Oper. Res. 36, No. 1, 37--51 (2002; Zbl 1024.68007) Full Text: DOI Numdam Numdam EuDML
Bischof, Stefan; Mayr, Ernst W. On-line scheduling of parallel jobs with runtime restrictions. (English) Zbl 0984.68015 Theor. Comput. Sci. 268, No. 1, 67-90 (2001). MSC: 68M20 68W10 PDFBibTeX XMLCite \textit{S. Bischof} and \textit{E. W. Mayr}, Theor. Comput. Sci. 268, No. 1, 67--90 (2001; Zbl 0984.68015) Full Text: DOI
Baptiste, Philippe; Jouglet, Antoine On minimizing total tardiness in a serial batching problem. (English) Zbl 0991.90062 RAIRO, Oper. Res. 35, No. 1, 107-115 (2001). Reviewer: Václav Koubek (Praha) MSC: 90B35 68M20 90C27 90C39 68Q17 PDFBibTeX XMLCite \textit{P. Baptiste} and \textit{A. Jouglet}, RAIRO, Oper. Res. 35, No. 1, 107--115 (2001; Zbl 0991.90062) Full Text: DOI Numdam Numdam EuDML
Baptiste, Philippe; Timkovsky, Vadim G. On preemption redundancy in scheduling unit processing time jobs on two parallel machines. (English) Zbl 0992.90026 Oper. Res. Lett. 28, No. 5, 205-212 (2001). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{P. Baptiste} and \textit{V. G. Timkovsky}, Oper. Res. Lett. 28, No. 5, 205--212 (2001; Zbl 0992.90026) Full Text: DOI
Hall, Nicholas G.; Potts, Chris N.; Sriskandarajah, Chelliah Parallel machine scheduling with a common server. (English) Zbl 0972.90031 Discrete Appl. Math. 102, No. 3, 223-243 (2000). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{N. G. Hall} et al., Discrete Appl. Math. 102, No. 3, 223--243 (2000; Zbl 0972.90031) Full Text: DOI
Shakhlevich, Natalia V.; Sotskov, Yuri N.; Werner, Frank Complexity of mixed shop scheduling problems: A survey. (English) Zbl 0949.90047 Eur. J. Oper. Res. 120, No. 2, 343-351 (2000). MSC: 90B35 90C60 68Q25 PDFBibTeX XMLCite \textit{N. V. Shakhlevich} et al., Eur. J. Oper. Res. 120, No. 2, 343--351 (2000; Zbl 0949.90047) Full Text: DOI
Krishnamurti, Ramesh; Gaur, Daya Ram An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems. (English) Zbl 0999.68022 Inf. Process. Lett. 72, No. 5-6, 183-188 (1999). MSC: 68M20 68W25 PDFBibTeX XMLCite \textit{R. Krishnamurti} and \textit{D. R. Gaur}, Inf. Process. Lett. 72, No. 5--6, 183--188 (1999; Zbl 0999.68022) Full Text: DOI
Cheng, T. C. E.; Ding, Q. The complexity of scheduling starting time dependent tasks with release times. (English) Zbl 1338.68096 Inf. Process. Lett. 65, No. 2, 75-79 (1998). MSC: 68Q25 68Q17 90B35 PDFBibTeX XMLCite \textit{T. C. E. Cheng} and \textit{Q. Ding}, Inf. Process. Lett. 65, No. 2, 75--79 (1998; Zbl 1338.68096) Full Text: DOI Link
Bianco, L.; Błażewicz, J.; Dell’Olmo, P.; Drozdowski, M. Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness. (English) Zbl 0863.68016 Discrete Appl. Math. 72, No. 1-2, 25-46 (1997). MSC: 68M20 PDFBibTeX XMLCite \textit{L. Bianco} et al., Discrete Appl. Math. 72, No. 1--2, 25--46 (1997; Zbl 0863.68016) Full Text: DOI Link
Dror, Moshe; Kubiak, Wieslaw; Dell’Olmo, Paolo Scheduling chains to minimize mean flow time. (English) Zbl 1337.68128 Inf. Process. Lett. 61, No. 6, 297-301 (1997). MSC: 68Q25 68M20 PDFBibTeX XMLCite \textit{M. Dror} et al., Inf. Process. Lett. 61, No. 6, 297--301 (1997; Zbl 1337.68128) Full Text: DOI
Błażewicz, Jacek; Drozdowski, Maciej Distributed processing of divisible jobs with communication startup costs. (English) Zbl 0879.68022 Discrete Appl. Math. 76, No. 1-3, 21-41 (1997). MSC: 68N25 PDFBibTeX XMLCite \textit{J. Błażewicz} and \textit{M. Drozdowski}, Discrete Appl. Math. 76, No. 1--3, 21--41 (1997; Zbl 0879.68022) Full Text: DOI Link
Dell’Olmo, P.; Speranza, M. G.; Tuza, Zsolt Efficiency and effectiveness of normal schedules on three dedicated processors. (English) Zbl 0871.90045 Discrete Math. 164, No. 1-3, 67-79 (1997). MSC: 90B35 68M20 68R10 PDFBibTeX XMLCite \textit{P. Dell'Olmo} et al., Discrete Math. 164, No. 1--3, 67--79 (1997; Zbl 0871.90045) Full Text: DOI
Drozdowski, Maciej Real-time scheduling of linear speedup parallel tasks. (English) Zbl 0900.68040 Inf. Process. Lett. 57, No. 1, 35-40 (1996). MSC: 68M20 68Q10 68M99 PDFBibTeX XMLCite \textit{M. Drozdowski}, Inf. Process. Lett. 57, No. 1, 35--40 (1996; Zbl 0900.68040) Full Text: DOI
Błażewicz, J.; Drozdowski, M.; de Werra, D.; Węglarz, J. Deadline scheduling of multiprocessor tasks. (English) Zbl 0854.68005 Discrete Appl. Math. 65, No. 1-3, 81-95 (1996). MSC: 68M20 PDFBibTeX XMLCite \textit{J. Błażewicz} et al., Discrete Appl. Math. 65, No. 1--3, 81--95 (1996; Zbl 0854.68005) Full Text: DOI
Błażewicz, Jacek; Liu, Zhen Scheduling multiprocessor tasks with chain constraints. (English) Zbl 0949.68505 Eur. J. Oper. Res. 94, No. 2, 231-241 (1996). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{J. Błażewicz} and \textit{Z. Liu}, Eur. J. Oper. Res. 94, No. 2, 231--241 (1996; Zbl 0949.68505) Full Text: DOI
Drozdowski, Maciej Scheduling multiprocessor tasks – An overview. (English) Zbl 0949.68506 Eur. J. Oper. Res. 94, No. 2, 215-230 (1996). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{M. Drozdowski}, Eur. J. Oper. Res. 94, No. 2, 215--230 (1996; Zbl 0949.68506) Full Text: DOI
Sabuncuoglu, Ihsan; Gurgun, Burckaan A neural network model for scheduling problems. (English) Zbl 0913.90180 Eur. J. Oper. Res. 93, No. 2, 288-299 (1996). MSC: 90B35 68T05 PDFBibTeX XMLCite \textit{I. Sabuncuoglu} and \textit{B. Gurgun}, Eur. J. Oper. Res. 93, No. 2, 288--299 (1996; Zbl 0913.90180) Full Text: DOI Link
Sgall, Jiří On-line scheduling of parallel jobs. (English) Zbl 1493.68038 Privara, Igor (ed.) et al., Mathematical foundations of computer science 1994. 19th international symposium, MFCS ’94, Košice, Slovakia, August 22–26, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 841, 159-176 (1994). MSC: 68M20 68W27 90B35 PDFBibTeX XMLCite \textit{J. Sgall}, Lect. Notes Comput. Sci. 841, 159--176 (1994; Zbl 1493.68038) Full Text: DOI
Ho, Kevin I-J.; Leung, Joseph Y-T.; Wei, W-D. Complexity of scheduling tasks with time-dependent execution times. (English) Zbl 0942.68508 Inf. Process. Lett. 48, No. 6, 315-320 (1993). MSC: 68M20 68Q25 PDFBibTeX XMLCite \textit{K. I J. Ho} et al., Inf. Process. Lett. 48, No. 6, 315--320 (1993; Zbl 0942.68508) Full Text: DOI
Bianco, L.; Błażewicz, J.; Dell’Olmo, P.; Drozdowski, M. Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness. (English) Zbl 0781.90049 Inf. Process. Lett. 46, No. 3, 109-113 (1993). Reviewer: H.Daduna (Hamburg) MSC: 90B35 68M20 90C60 68W15 68Q25 PDFBibTeX XMLCite \textit{L. Bianco} et al., Inf. Process. Lett. 46, No. 3, 109--113 (1993; Zbl 0781.90049) Full Text: DOI
Błażewicz, J.; Dell’Olmo, P.; Drozdowski, M.; Speranza, M. G. Scheduling multiprocessor tasks on three dedicated processors. (English) Zbl 0776.68023 Inf. Process. Lett. 41, No. 5, 275-280 (1992). Reviewer: M.Kubale (Gdańsk) MSC: 68M20 PDFBibTeX XMLCite \textit{J. Błażewicz} et al., Inf. Process. Lett. 41, No. 5, 275--280 (1992; Zbl 0776.68023) Full Text: DOI
Wang, Qingzhou; Cheng, Kam Hoi List scheduling of parallel tasks. (English) Zbl 0724.68013 Inf. Process. Lett. 37, No. 5, 291-297 (1991). MSC: 68M20 68R05 PDFBibTeX XMLCite \textit{Q. Wang} and \textit{K. H. Cheng}, Inf. Process. Lett. 37, No. 5, 291--297 (1991; Zbl 0724.68013) Full Text: DOI
Woeginger, Gerhard On minimizing the sum of \(k\) tardinesses. (English) Zbl 0738.68014 Inf. Process. Lett. 38, No. 5, 253-256 (1991). MSC: 68M20 68Q25 90B35 68R05 PDFBibTeX XMLCite \textit{G. Woeginger}, Inf. Process. Lett. 38, No. 5, 253--256 (1991; Zbl 0738.68014) Full Text: DOI