Xiao, Man; Liu, Xiaoqiao; Li, Weidong Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time. (English) Zbl 07761583 J. Comb. Optim. 46, No. 3, Paper No. 21, 19 p. (2023). MSC: 90B35 68M20 68W27 PDFBibTeX XMLCite \textit{M. Xiao} et al., J. Comb. Optim. 46, No. 3, Paper No. 21, 19 p. (2023; Zbl 07761583) Full Text: DOI
Akaria, Islam; Epstein, Leah Online scheduling with migration on two hierarchical machines. (English) Zbl 1505.90050 J. Comb. Optim. 44, No. 5, 3535-3548 (2022). MSC: 90B35 PDFBibTeX XMLCite \textit{I. Akaria} and \textit{L. Epstein}, J. Comb. Optim. 44, No. 5, 3535--3548 (2022; Zbl 1505.90050) Full Text: DOI
Wang, Yinling; Lan, Yan; Chen, Xin; Han, Xin; Piao, Yong A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\). (English) Zbl 1503.90048 J. Comb. Optim. 44, No. 4, 2195-2206 (2022). MSC: 90B35 90C59 90B06 PDFBibTeX XMLCite \textit{Y. Wang} et al., J. Comb. Optim. 44, No. 4, 2195--2206 (2022; Zbl 1503.90048) Full Text: DOI
Wu, Yuanxiao; Lu, Xiwen Capacitated vehicle routing problem on line with unsplittable demands. (English) Zbl 1502.90160 J. Comb. Optim. 44, No. 3, 1953-1963 (2022). MSC: 90C27 90B06 90C59 PDFBibTeX XMLCite \textit{Y. Wu} and \textit{X. Lu}, J. Comb. Optim. 44, No. 3, 1953--1963 (2022; Zbl 1502.90160) Full Text: DOI
Zhang, Chenhao; Zhang, Guochuan From packing rules to cost-sharing mechanisms. (English) Zbl 1502.90161 J. Comb. Optim. 44, No. 3, 1578-1593 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{C. Zhang} and \textit{G. Zhang}, J. Comb. Optim. 44, No. 3, 1578--1593 (2022; Zbl 1502.90161) Full Text: DOI
Xu, Yinfeng; Zhi, Rongteng; Zheng, Feifeng; Liu, Ming Competitive algorithm for scheduling of sharing machines with rental discount. (English) Zbl 1498.90106 J. Comb. Optim. 44, No. 1, 414-434 (2022). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{Y. Xu} et al., J. Comb. Optim. 44, No. 1, 414--434 (2022; Zbl 1498.90106) Full Text: DOI
Zheng, Feifeng; Chen, Yuhong; Liu, Ming; Xu, Yinfeng Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence. (English) Zbl 1497.90104 J. Comb. Optim. 44, No. 2, 1060-1076 (2022). MSC: 90B35 PDFBibTeX XMLCite \textit{F. Zheng} et al., J. Comb. Optim. 44, No. 2, 1060--1076 (2022; Zbl 1497.90104) Full Text: DOI
Fan, Jing; Shi, Hui Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance. (English) Zbl 1495.90069 J. Comb. Optim. 43, No. 5, 1645-1654 (2022). MSC: 90B35 90B25 68M20 68W25 PDFBibTeX XMLCite \textit{J. Fan} and \textit{H. Shi}, J. Comb. Optim. 43, No. 5, 1645--1654 (2022; Zbl 1495.90069) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf Lower bounds for batched bin packing. (English) Zbl 1490.90235 J. Comb. Optim. 43, No. 3, 613-629 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{J. Balogh} et al., J. Comb. Optim. 43, No. 3, 613--629 (2022; Zbl 1490.90235) Full Text: DOI
Chen, Xin; Nong, Qingqin; Fang, Qizhi An improved mechanism for selfish bin packing. (English) Zbl 1481.90272 J. Comb. Optim. 42, No. 3, 636-656 (2021). MSC: 90C27 91A10 PDFBibTeX XMLCite \textit{X. Chen} et al., J. Comb. Optim. 42, No. 3, 636--656 (2021; Zbl 1481.90272) Full Text: DOI
Li, Rongqi; Tan, Zhiyi; Zhu, Qianyu Batch scheduling of nonidentical job sizes with minsum criteria. (English) Zbl 1481.90178 J. Comb. Optim. 42, No. 3, 543-564 (2021). MSC: 90B35 90C27 68Q25 68M20 PDFBibTeX XMLCite \textit{R. Li} et al., J. Comb. Optim. 42, No. 3, 543--564 (2021; Zbl 1481.90178) Full Text: DOI
Erzin, Adil; Melidi, Georgii; Nazarenko, Stepan; Plotnikov, Roman A 3/2-approximation for big two-bar charts packing. (English) Zbl 1473.90137 J. Comb. Optim. 42, No. 1, 71-84 (2021). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{A. Erzin} et al., J. Comb. Optim. 42, No. 1, 71--84 (2021; Zbl 1473.90137) Full Text: DOI arXiv
Bilò, Vittorio; Cellinese, Francesco; Melideo, Giovanna; Monaco, Gianpiero Selfish colorful bin packing games. (English) Zbl 1466.91006 J. Comb. Optim. 40, No. 3, 610-635 (2020). Reviewer: George Stoica (Saint John) MSC: 91A10 PDFBibTeX XMLCite \textit{V. Bilò} et al., J. Comb. Optim. 40, No. 3, 610--635 (2020; Zbl 1466.91006) Full Text: DOI
Epstein, Leah A lower bound for online rectangle packing. (English) Zbl 1431.90130 J. Comb. Optim. 38, No. 3, 846-866 (2019). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Epstein}, J. Comb. Optim. 38, No. 3, 846--866 (2019; Zbl 1431.90130) Full Text: DOI arXiv
Pinson, Nicolas; Spieksma, Frits C. R. Online interval scheduling on two related machines: the power of lookahead. (English) Zbl 1423.90098 J. Comb. Optim. 38, No. 1, 224-253 (2019). MSC: 90B35 68W27 PDFBibTeX XMLCite \textit{N. Pinson} and \textit{F. C. R. Spieksma}, J. Comb. Optim. 38, No. 1, 224--253 (2019; Zbl 1423.90098) Full Text: DOI
Dósa, György; Epstein, Leah Pareto optimal equilibria for selfish bin packing with uniform cost sharing. (English) Zbl 1425.90089 J. Comb. Optim. 37, No. 3, 827-847 (2019). MSC: 90C27 90C29 91A10 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{L. Epstein}, J. Comb. Optim. 37, No. 3, 827--847 (2019; Zbl 1425.90089) Full Text: DOI
König, Jürgen; Mäcker, Alexander; Meyer auf der Heide, Friedhelm; Riechers, Sören Scheduling with interjob communication on parallel processors. (English) Zbl 1414.90155 J. Comb. Optim. 36, No. 4, 1356-1379 (2018). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{J. König} et al., J. Comb. Optim. 36, No. 4, 1356--1379 (2018; Zbl 1414.90155) Full Text: DOI
Nong, Q. Q.; Sun, T.; Cheng, T. C. E.; Fang, Q. Z. Bin packing game with a price of anarchy of \(\frac{3}{2}\). (English) Zbl 1390.91022 J. Comb. Optim. 35, No. 2, 632-640 (2018). MSC: 91A10 90C70 PDFBibTeX XMLCite \textit{Q. Q. Nong} et al., J. Comb. Optim. 35, No. 2, 632--640 (2018; Zbl 1390.91022) Full Text: DOI
Wang, Zhenbo; Nip, Kameng Bin packing under linear constraints. (English) Zbl 1383.90035 J. Comb. Optim. 34, No. 4, 1198-1209 (2017). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{Z. Wang} and \textit{K. Nip}, J. Comb. Optim. 34, No. 4, 1198--1209 (2017; Zbl 1383.90035) Full Text: DOI
Hu, Jueliang; Jiang, Yiwei; Zhou, Ping; Zhang, An; Zhang, Qinghui Total completion time minimization in online hierarchical scheduling of unit-size jobs. (English) Zbl 1370.90115 J. Comb. Optim. 33, No. 3, 866-881 (2017). MSC: 90B35 PDFBibTeX XMLCite \textit{J. Hu} et al., J. Comb. Optim. 33, No. 3, 866--881 (2017; Zbl 1370.90115) Full Text: DOI
Zhang, Minghui; Han, Xin; Lan, Yan; Ting, Hing-Fung Online bin packing problem with buffer and bounded size revisited. (English) Zbl 1361.90056 J. Comb. Optim. 33, No. 2, 530-542 (2017). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. Zhang} et al., J. Comb. Optim. 33, No. 2, 530--542 (2017; Zbl 1361.90056) Full Text: DOI
Zhang, Liqi; Lu, Lingfa; Li, Shisheng New results on two-machine flow-shop scheduling with rejection. (English) Zbl 1343.90042 J. Comb. Optim. 31, No. 4, 1493-1504 (2016). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{L. Zhang} et al., J. Comb. Optim. 31, No. 4, 1493--1504 (2016; Zbl 1343.90042) Full Text: DOI
Dong, Jianming; Wang, Xueshi; Hu, Jueliang; Lin, Guohui An improved two-machine flowshop scheduling with intermediate transportation. (English) Zbl 1343.90033 J. Comb. Optim. 31, No. 3, 1316-1334 (2016). MSC: 90B35 90C27 PDFBibTeX XMLCite \textit{J. Dong} et al., J. Comb. Optim. 31, No. 3, 1316--1334 (2016; Zbl 1343.90033) Full Text: DOI
Zheng, Feifeng; Luo, Li; Zhang, E. NF-based algorithms for online bin packing with buffer and bounded item size. (English) Zbl 1319.90060 J. Comb. Optim. 30, No. 2, 360-369 (2015). MSC: 90C27 PDFBibTeX XMLCite \textit{F. Zheng} et al., J. Comb. Optim. 30, No. 2, 360--369 (2015; Zbl 1319.90060) Full Text: DOI
Xiang, Xiangzhong Prompt mechanism for online auctions with multi-unit demands. (English) Zbl 1319.90059 J. Comb. Optim. 30, No. 2, 335-346 (2015). MSC: 90C27 PDFBibTeX XMLCite \textit{X. Xiang}, J. Comb. Optim. 30, No. 2, 335--346 (2015; Zbl 1319.90059) Full Text: DOI
Zhang, An; Jiang, Yiwei; Fan, Lidan; Hu, Jueliang Optimal online algorithms on two hierarchical machines with tightly-grouped processing times. (English) Zbl 1320.90039 J. Comb. Optim. 29, No. 4, 781-795 (2015). MSC: 90B35 PDFBibTeX XMLCite \textit{A. Zhang} et al., J. Comb. Optim. 29, No. 4, 781--795 (2015; Zbl 1320.90039) Full Text: DOI
Epstein, Leah; Zebedat-Haider, Hanan Online scheduling with rejection and reordering: exact algorithms for unit size jobs. (English) Zbl 1307.90069 J. Comb. Optim. 28, No. 4, 875-892 (2014). MSC: 90B35 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{H. Zebedat-Haider}, J. Comb. Optim. 28, No. 4, 875--892 (2014; Zbl 1307.90069) Full Text: DOI
Dosa, Gyorgy; Tuza, Zsolt; Ye, Deshi Bin packing with “largest in bottom” constraint: tighter bounds and generalizations. (English) Zbl 1282.90149 J. Comb. Optim. 26, No. 3, 416-436 (2013). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{G. Dosa} et al., J. Comb. Optim. 26, No. 3, 416--436 (2013; Zbl 1282.90149) Full Text: DOI
Li, Rongheng; Yang, Liying; He, Xiaoqiong; Chen, Qiang; Cheng, Xiayan Semi-online scheduling for jobs with release times. (English) Zbl 1282.90074 J. Comb. Optim. 26, No. 3, 448-464 (2013). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{R. Li} et al., J. Comb. Optim. 26, No. 3, 448--464 (2013; Zbl 1282.90074) Full Text: DOI
Min, Xiao; Wang, Yuqing; Liu, Jing; Jiang, Min Semi-online scheduling on two identical machines with rejection. (English) Zbl 1282.90075 J. Comb. Optim. 26, No. 3, 472-479 (2013). MSC: 90B35 PDFBibTeX XMLCite \textit{X. Min} et al., J. Comb. Optim. 26, No. 3, 472--479 (2013; Zbl 1282.90075) Full Text: DOI
Hou, Li-ying; Kang, Liying Online scheduling on uniform machines with two hierarchies. (English) Zbl 1261.90017 J. Comb. Optim. 24, No. 4, 593-612 (2012). MSC: 90B35 PDFBibTeX XMLCite \textit{L.-y. Hou} and \textit{L. Kang}, J. Comb. Optim. 24, No. 4, 593--612 (2012; Zbl 1261.90017) Full Text: DOI
Dósa, György; Grazia Speranza, M.; Tuza, Zsolt Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling. (English) Zbl 1319.90030 J. Comb. Optim. 21, No. 4, 458-480 (2011). MSC: 90B35 90C60 68W27 PDFBibTeX XMLCite \textit{G. Dósa} et al., J. Comb. Optim. 21, No. 4, 458--480 (2011; Zbl 1319.90030) Full Text: DOI
Cai, Sheng-Yi; Yang, Qi-Fan Semi-online scheduling on two uniform machines with the known largest size. (English) Zbl 1319.90029 J. Comb. Optim. 21, No. 4, 393-408 (2011). MSC: 90B35 68Q17 68W27 68W40 PDFBibTeX XMLCite \textit{S.-Y. Cai} and \textit{Q.-F. Yang}, J. Comb. Optim. 21, No. 4, 393--408 (2011; Zbl 1319.90029) Full Text: DOI
Min, Xiao; Liu, Jing; Wang, Yuqing Optimal semi-online algorithm for scheduling with rejection on two uniform machines. (English) Zbl 1236.90055 J. Comb. Optim. 22, No. 4, 674-683 (2011). MSC: 90B35 PDFBibTeX XMLCite \textit{X. Min} et al., J. Comb. Optim. 22, No. 4, 674--683 (2011; Zbl 1236.90055) Full Text: DOI
Tan, Zhiyi; Zhang, An A note on hierarchical scheduling on two uniform machines. (English) Zbl 1198.90210 J. Comb. Optim. 20, No. 1, 85-95 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{Z. Tan} and \textit{A. Zhang}, J. Comb. Optim. 20, No. 1, 85--95 (2010; Zbl 1198.90210) Full Text: DOI
Jiang, Yiwei; Zhang, An; Tan, Zhiyi Online coupon consumption problem. (English) Zbl 1163.90713 J. Comb. Optim. 16, No. 1, 1-15 (2008). MSC: 90C27 PDFBibTeX XMLCite \textit{Y. Jiang} et al., J. Comb. Optim. 16, No. 1, 1--15 (2008; Zbl 1163.90713) Full Text: DOI
Epstein, Leah; Ye, Deshi Semi-online scheduling with “end of sequence” information. (English) Zbl 1180.90118 J. Comb. Optim. 14, No. 1, 45-61 (2007). MSC: 90B35 68W40 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{D. Ye}, J. Comb. Optim. 14, No. 1, 45--61 (2007; Zbl 1180.90118) Full Text: DOI
Dósa, György; He, Yong Scheduling with machine cost and rejection. (English) Zbl 1126.90021 J. Comb. Optim. 12, No. 4, 337-350 (2006). MSC: 90B35 90C35 PDFBibTeX XMLCite \textit{G. Dósa} and \textit{Y. He}, J. Comb. Optim. 12, No. 4, 337--350 (2006; Zbl 1126.90021) Full Text: DOI