Schulz, Arne The balanced maximally diverse grouping problem with integer attribute values. (English) Zbl 07721477 J. Comb. Optim. 45, No. 5, Paper No. 135, 27 p. (2023). MSC: 90Cxx PDF BibTeX XML Cite \textit{A. Schulz}, J. Comb. Optim. 45, No. 5, Paper No. 135, 27 p. (2023; Zbl 07721477) Full Text: DOI
Cho, Woo-Hyung; Shmoys, David; Henderson, Shane SPT optimality (mostly) via linear programming. (English) Zbl 07702782 Oper. Res. Lett. 51, No. 1, 99-104 (2023). MSC: 90-XX PDF BibTeX XML Cite \textit{W.-H. Cho} et al., Oper. Res. Lett. 51, No. 1, 99--104 (2023; Zbl 07702782) Full Text: DOI
Ma, Ran; Guo, Sainan; Zhang, Xiaoyan An optimal online algorithm for single-processor scheduling problem with learning effect. (English) Zbl 07597572 Theor. Comput. Sci. 928, 1-12 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{R. Ma} et al., Theor. Comput. Sci. 928, 1--12 (2022; Zbl 07597572) Full Text: DOI
Przybylski, Bartłomiej Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times. (English) Zbl 1498.90095 J. Comb. Optim. 44, No. 1, 207-222 (2022). MSC: 90B35 PDF BibTeX XML Cite \textit{B. Przybylski}, J. Comb. Optim. 44, No. 1, 207--222 (2022; Zbl 1498.90095) Full Text: DOI
Kim, Kilhwan \((N, n)\)-preemptive-priority M/G/1 queues with finite and infinite buffers. (English) Zbl 1499.90064 J. Appl. Math. 2022, Article ID 5834258, 20 p. (2022). MSC: 90B22 60K25 PDF BibTeX XML Cite \textit{K. Kim}, J. Appl. Math. 2022, Article ID 5834258, 20 p. (2022; Zbl 1499.90064) Full Text: DOI
Correa, José R.; Muñoz, Felipe T. Performance guarantees of local search for minsum scheduling problems. (English) Zbl 1485.90040 Math. Program. 191, No. 2 (A), 847-869 (2022). MSC: 90B35 90C59 68M20 PDF BibTeX XML Cite \textit{J. R. Correa} and \textit{F. T. Muñoz}, Math. Program. 191, No. 2 (A), 847--869 (2022; Zbl 1485.90040) Full Text: DOI
Liu, Qiong; Liu, Jialiang; Dong, Zhaorui; Zhan, Mengmeng; Mei, Zhen; Ying, Baosheng; Shao, Xinyu Integrated optimization of process planning and scheduling for reducing carbon emissions. (English) Zbl 1476.90127 J. Ind. Manag. Optim. 17, No. 3, 1025-1055 (2021). MSC: 90B35 90C10 90C59 90C29 PDF BibTeX XML Cite \textit{Q. Liu} et al., J. Ind. Manag. Optim. 17, No. 3, 1025--1055 (2021; Zbl 1476.90127) Full Text: DOI
Chamberlain, Jonathan; Simhon, Eran; Starobinski, David Preemptible queues with advance reservations: strategic behavior and revenue management. (English) Zbl 1487.90215 Eur. J. Oper. Res. 293, No. 2, 561-578 (2021). MSC: 90B22 60K25 91A80 PDF BibTeX XML Cite \textit{J. Chamberlain} et al., Eur. J. Oper. Res. 293, No. 2, 561--578 (2021; Zbl 1487.90215) Full Text: DOI
Chamberlain, Jonathan; Starobinski, David Social welfare and price of anarchy in preemptive priority queues. (English) Zbl 1478.90024 Oper. Res. Lett. 48, No. 4, 530-533 (2020). MSC: 90B22 90B35 91A80 PDF BibTeX XML Cite \textit{J. Chamberlain} and \textit{D. Starobinski}, Oper. Res. Lett. 48, No. 4, 530--533 (2020; Zbl 1478.90024) Full Text: DOI arXiv
Ravi, Peruvemba Sundaram; Tunçel, Levent Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture. (English) Zbl 1441.68015 Inf. Process. Lett. 159-160, Article ID 105959, 4 p. (2020). MSC: 68M20 68W25 90B35 PDF BibTeX XML Cite \textit{P. S. Ravi} and \textit{L. Tunçel}, Inf. Process. Lett. 159--160, Article ID 105959, 4 p. (2020; Zbl 1441.68015) Full Text: DOI arXiv
Wang, Shijin; Wu, Ruochen; Chu, Feng; Yu, Jianbo Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job. (English) Zbl 1458.90368 Comput. Oper. Res. 118, Article ID 104918, 16 p. (2020). MSC: 90B35 PDF BibTeX XML Cite \textit{S. Wang} et al., Comput. Oper. Res. 118, Article ID 104918, 16 p. (2020; Zbl 1458.90368) Full Text: DOI
Dong, Jianming; Jin, Ruyan; Luo, Taibo; Tong, Weitian A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops. (English) Zbl 1430.90257 Eur. J. Oper. Res. 281, No. 1, 16-24 (2020). MSC: 90B35 90C11 PDF BibTeX XML Cite \textit{J. Dong} et al., Eur. J. Oper. Res. 281, No. 1, 16--24 (2020; Zbl 1430.90257) 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 PDF BibTeX XML Cite \textit{S. Knust} et al., J. Sched. 22, No. 6, 635--661 (2019; Zbl 1432.90059) Full Text: DOI
Eberle, Franziska; Fischer, Felix; Matuschke, Jannik; Megow, Nicole On index policies for stochastic minsum scheduling. (English) Zbl 1476.90141 Oper. Res. Lett. 47, No. 3, 213-218 (2019). MSC: 90B36 PDF BibTeX XML Cite \textit{F. Eberle} et al., Oper. Res. Lett. 47, No. 3, 213--218 (2019; Zbl 1476.90141) Full Text: DOI Link
Epstein, Leah; Levin, Asaf Robust algorithms for total completion time. (English) Zbl 1506.90097 Discrete Optim. 33, 70-86 (2019). MSC: 90B35 90C17 PDF BibTeX XML Cite \textit{L. Epstein} and \textit{A. Levin}, Discrete Optim. 33, 70--86 (2019; Zbl 1506.90097) Full Text: DOI
Ballestín, Francisco; Pérez, Ángeles; Quintanilla, Sacramento Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients. (English) Zbl 1425.90038 J. Sched. 22, No. 1, 107-118 (2019). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{F. Ballestín} et al., J. Sched. 22, No. 1, 107--118 (2019; Zbl 1425.90038) Full Text: DOI
Zhang, Long; Zhang, Yuzhong; Du, Donglei; Bai, Qingguo Improved price of anarchy for machine scheduling games with coordination mechanisms. (English) Zbl 1423.90103 Optim. Lett. 13, No. 4, 949-959 (2019). MSC: 90B35 91A10 91A40 PDF BibTeX XML Cite \textit{L. Zhang} et al., Optim. Lett. 13, No. 4, 949--959 (2019; Zbl 1423.90103) Full Text: DOI
Hoeksma, Ruben; Uetz, Marc The price of anarchy for utilitarian scheduling games on related machines. (English) Zbl 1506.90103 Discrete Optim. 31, 29-39 (2019). MSC: 90B35 91A10 91A80 PDF BibTeX XML Cite \textit{R. Hoeksma} and \textit{M. Uetz}, Discrete Optim. 31, 29--39 (2019; Zbl 1506.90103) Full Text: DOI Link
Drozdov, Alexander Yu.; Tchernykh, Andrei; Novikov, Sergey V.; Vladislavlev, Victor E.; Rivera-Rodriguez, Raul PHEFT: pessimistic image processing workflow scheduling for DSP clusters. (English) Zbl 1461.90044 Algorithms (Basel) 11, No. 5, Paper No. 76, 13 p. (2018). MSC: 90B35 94A08 68M20 68U10 PDF BibTeX XML Cite \textit{A. Yu. Drozdov} et al., Algorithms (Basel) 11, No. 5, Paper No. 76, 13 p. (2018; Zbl 1461.90044) Full Text: DOI
Benavides, Alexander J.; Ritt, Marcus Fast heuristics for minimizing the makespan in non-permutation flow shops. (English) Zbl 1458.90254 Comput. Oper. Res. 100, 230-243 (2018). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{A. J. Benavides} and \textit{M. Ritt}, Comput. Oper. Res. 100, 230--243 (2018; Zbl 1458.90254) Full Text: DOI
Kubo, Susumu; Nishinari, Katsuhiro Applications of max-plus algebra to flow shop scheduling problems. (English) Zbl 1403.90340 Discrete Appl. Math. 247, 278-293 (2018). MSC: 90B35 15A80 65F30 PDF BibTeX XML Cite \textit{S. Kubo} and \textit{K. Nishinari}, Discrete Appl. Math. 247, 278--293 (2018; Zbl 1403.90340) Full Text: DOI
Tong, Weitian; Miyano, Eiji; Goebel, Randy; Lin, Guohui An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. (English) Zbl 1393.68041 Theor. Comput. Sci. 734, 24-31 (2018). MSC: 68M20 68W25 90B35 PDF BibTeX XML Cite \textit{W. Tong} et al., Theor. Comput. Sci. 734, 24--31 (2018; Zbl 1393.68041) Full Text: DOI
Iwanir, Elad; Tamir, Tami Analysis and experimental study of heuristics for job scheduling reoptimization problems. (English) Zbl 1384.90127 Fidanova, Stefka (ed.), Recent advances in computational optimization. Results of the workshop on computational optimization WCO 2016. Cham: Springer (ISBN 978-3-319-59860-4/hbk; 978-3-319-59861-1/ebook). Studies in Computational Intelligence 717, 207-233 (2018). MSC: 90C90 90C59 90B35 PDF BibTeX XML Cite \textit{E. Iwanir} and \textit{T. Tamir}, Stud. Comput. Intell. 717, 207--233 (2018; Zbl 1384.90127) Full Text: DOI
Knopp, Sebastian; Dauzère-Pérès, Stéphane; Yugma, Claude A batch-oblivious approach for complex job-shop scheduling problems. (English) Zbl 1380.90119 Eur. J. Oper. Res. 263, No. 1, 50-61 (2017). MSC: 90B35 90C59 90C90 PDF BibTeX XML Cite \textit{S. Knopp} et al., Eur. J. Oper. Res. 263, No. 1, 50--61 (2017; Zbl 1380.90119) Full Text: DOI
Kanet, J. J.; Wells, C. E. An examination of job interchange relationships and induction-based proofs in single machine scheduling. (English) Zbl 1369.90078 Ann. Oper. Res. 253, No. 1, 345-351 (2017). MSC: 90B35 PDF BibTeX XML Cite \textit{J. J. Kanet} and \textit{C. E. Wells}, Ann. Oper. Res. 253, No. 1, 345--351 (2017; Zbl 1369.90078) Full Text: DOI
Fajardo, Val Andrei; Drekic, Steve Waiting time distributions in the preemptive accumulating priority queue. (English) Zbl 1360.60164 Methodol. Comput. Appl. Probab. 19, No. 1, 255-284 (2017). MSC: 60K25 90B22 68M20 PDF BibTeX XML Cite \textit{V. A. Fajardo} and \textit{S. Drekic}, Methodol. Comput. Appl. Probab. 19, No. 1, 255--284 (2017; Zbl 1360.60164) Full Text: DOI Link
Lan, Yan; Han, Xin; Wang, Yinling; Ge, Min; Guo, He; Chen, Xin Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited. (English) Zbl 1362.90200 Theor. Comput. Sci. 670, 79-85 (2017). MSC: 90B35 68Q17 90B30 90B22 PDF BibTeX XML Cite \textit{Y. Lan} et al., Theor. Comput. Sci. 670, 79--85 (2017; Zbl 1362.90200) Full Text: DOI
Dong, Jianming; Tong, Weitian; Luo, Taibo; Wang, Xueshi; Hu, Jueliang; Xu, Yinfeng; Lin, Guohui An FPTAS for the parallel two-stage flowshop problem. (English) Zbl 1356.68023 Theor. Comput. Sci. 657, Part A, 64-72 (2017); corrigendum ibid. 687, 93-94 (2017). MSC: 68M20 68Q25 68W25 90B35 90C39 90C59 PDF BibTeX XML Cite \textit{J. Dong} et al., Theor. Comput. Sci. 657, Part A, 64--72 (2017; Zbl 1356.68023) Full Text: DOI
Epstein, Leah; Levin, Asaf; Soper, Alan J.; Strusevich, Vitaly A. Power of preemption for minimizing total completion time on uniform parallel machines. (English) Zbl 1354.90049 SIAM J. Discrete Math. 31, No. 1, 101-123 (2017). MSC: 90B35 68R99 68W40 PDF BibTeX XML Cite \textit{L. Epstein} et al., SIAM J. Discrete Math. 31, No. 1, 101--123 (2017; Zbl 1354.90049) Full Text: DOI
Tong, Weitian; Miyano, Eiji; Goebel, Randy; Lin, Guohui A PTAS for the multiple parallel identical multi-stage flow-shops to minimize the makespan. (English) Zbl 1475.90024 Zhu, Daming (ed.) et al., Frontiers in algorithmics. 10th international workshop, FAW 2016, Qingdao, China, June 30 – July 2, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9711, 227-237 (2016). MSC: 90B35 68M20 68W25 PDF BibTeX XML Cite \textit{W. Tong} et al., Lect. Notes Comput. Sci. 9711, 227--237 (2016; Zbl 1475.90024) Full Text: DOI
Shen, Jiayu; Zhu, Yuanguo Chance-constrained model for uncertain job shop scheduling problem. (English) Zbl 1370.90120 Soft Comput. 20, No. 6, 2383-2391 (2016). MSC: 90B35 PDF BibTeX XML Cite \textit{J. Shen} and \textit{Y. Zhu}, Soft Comput. 20, No. 6, 2383--2391 (2016; Zbl 1370.90120) Full Text: DOI
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 PDF BibTeX XML Cite \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
Pereira, Jordi The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective. (English) Zbl 1349.90387 Comput. Oper. Res. 66, 141-152 (2016). MSC: 90B35 PDF BibTeX XML Cite \textit{J. Pereira}, Comput. Oper. Res. 66, 141--152 (2016; Zbl 1349.90387) Full Text: DOI
Ravi, Peruvemba Sundaram; Tunçel, Levent; Huang, Michael Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime. (English) Zbl 1353.90066 J. Sched. 19, No. 5, 547-561 (2016). MSC: 90B35 68M20 90C59 90C05 PDF BibTeX XML Cite \textit{P. S. Ravi} et al., J. Sched. 19, No. 5, 547--561 (2016; Zbl 1353.90066) Full Text: DOI arXiv
Detienne, Boris; Sadykov, Ruslan; Tanaka, Shunji The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation. (English) Zbl 1346.90337 Eur. J. Oper. Res. 252, No. 3, 750-760 (2016). MSC: 90B35 90C57 PDF BibTeX XML Cite \textit{B. Detienne} et al., Eur. J. Oper. Res. 252, No. 3, 750--760 (2016; Zbl 1346.90337) Full Text: DOI
Xingong, Zhang; Yong, Wang; Shikun, Bai Single-machine group scheduling problems with deteriorating and learning effect. (English) Zbl 1346.90318 Int. J. Syst. Sci., Princ. Appl. Syst. Integr. 47, No. 10, 2402-2410 (2016). MSC: 90B30 90B35 68T05 PDF BibTeX XML Cite \textit{Z. Xingong} et al., Int. J. Syst. Sci., Princ. Appl. Syst. Integr. 47, No. 10, 2402--2410 (2016; Zbl 1346.90318) Full Text: DOI
Davari, Morteza; Demeulemeester, Erik; Leus, Roel; Talla Nobibon, Fabrice Exact algorithms for single-machine scheduling with time windows and precedence constraints. (English) Zbl 1347.90037 J. Sched. 19, No. 3, 309-334 (2016). MSC: 90B35 68M20 90C57 90C11 PDF BibTeX XML Cite \textit{M. Davari} et al., J. Sched. 19, No. 3, 309--334 (2016; Zbl 1347.90037) Full Text: DOI Link
Kovalenko, Yu. V. On complexity of optimal recombination for flowshop scheduling problems. (Russian, English) Zbl 1349.90444 Diskretn. Anal. Issled. Oper. 23, No. 2, 41-62 (2016); translation in J. Appl. Ind. Math. 10, No. 2, 220-231 (2016). MSC: 90B36 90C59 65K10 PDF BibTeX XML Cite \textit{Yu. V. Kovalenko}, Diskretn. Anal. Issled. Oper. 23, No. 2, 41--62 (2016; Zbl 1349.90444); translation in J. Appl. Ind. Math. 10, No. 2, 220--231 (2016) Full Text: DOI
Dugarzhapov, Aldar; Kononov, Alexander A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job. (English) Zbl 1341.90043 J. Sched. 19, No. 1, 61-72 (2016). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{A. Dugarzhapov} and \textit{A. Kononov}, J. Sched. 19, No. 1, 61--72 (2016; Zbl 1341.90043) Full Text: DOI
Abouee-Mehrizi, Hossein; Baron, Opher State-dependent \(\mathrm{M}/\mathrm{G}/1\) queueing systems. (English) Zbl 1334.60187 Queueing Syst. 82, No. 1-2, 121-148 (2016). MSC: 60K25 60J80 60J25 60J10 90B22 PDF BibTeX XML Cite \textit{H. Abouee-Mehrizi} and \textit{O. Baron}, Queueing Syst. 82, No. 1--2, 121--148 (2016; Zbl 1334.60187) Full Text: DOI
Lan, Yan; Han, Xin; Wu, Zongtao; Guo, He; Chen, Xin Complexity of problem \(TF2|v=1,c=2|C_{\max}\). (English) Zbl 1326.90027 Inf. Process. Lett. 116, No. 1, 65-69 (2016). MSC: 90B35 68Q17 68W40 PDF BibTeX XML Cite \textit{Y. Lan} et al., Inf. Process. Lett. 116, No. 1, 65--69 (2016; Zbl 1326.90027) Full Text: DOI
Xiao, Yiyong; Yuan, Yingying; Zhang, Ren-Qian; Konak, Abdullah Non-permutation flow shop scheduling with order acceptance and weighted tardiness. (English) Zbl 1410.90098 Appl. Math. Comput. 270, 312-333 (2015). MSC: 90B35 68M20 68T05 PDF BibTeX XML Cite \textit{Y. Xiao} et al., Appl. Math. Comput. 270, 312--333 (2015; Zbl 1410.90098) Full Text: DOI
Fajardo, Val Andrei; Drekic, Steve Controlling the workload of M/G/1 queues via the \(q\)-policy. (English) Zbl 1346.90250 Eur. J. Oper. Res. 243, No. 2, 607-617 (2015). MSC: 90B22 60K25 PDF BibTeX XML Cite \textit{V. A. Fajardo} and \textit{S. Drekic}, Eur. J. Oper. Res. 243, No. 2, 607--617 (2015; Zbl 1346.90250) Full Text: DOI
Wan, Long; Ding, Zhihao; Li, Yunpeng; Chen, Qianqian; Tan, Zhiyi Scheduling to minimize the maximum total completion time per machine. (English) Zbl 1341.90056 Eur. J. Oper. Res. 242, No. 1, 45-50 (2015). MSC: 90B35 68Q17 PDF BibTeX XML Cite \textit{L. Wan} et al., Eur. J. Oper. Res. 242, No. 1, 45--50 (2015; Zbl 1341.90056) Full Text: DOI
Kravets, O. Ja.; Podvalny, E. S.; Barkalov, S. A. Quality assessment of a multistage process in the case of continuous response functions from resource influences. (English. Russian original) Zbl 1327.93295 Autom. Remote Control 76, No. 3, 500-506 (2015); translation from Sist. Upr. Inf. Tekh. 2014, No. 4, 151-155 (2014). MSC: 93C95 PDF BibTeX XML Cite \textit{O. Ja. Kravets} et al., Autom. Remote Control 76, No. 3, 500--506 (2015; Zbl 1327.93295); translation from Sist. Upr. Inf. Tekh. 2014, No. 4, 151--155 (2014) Full Text: DOI
Cole, Richard; Correa, José R.; Gkatzelis, Vasilis; Mirrokni, Vahab; Olver, Neil Decentralized utilitarian mechanisms for scheduling games. (English) Zbl 1356.91006 Games Econ. Behav. 92, 306-326 (2015). MSC: 91A10 90B35 68M20 91A80 PDF BibTeX XML Cite \textit{R. Cole} et al., Games Econ. Behav. 92, 306--326 (2015; Zbl 1356.91006) Full Text: DOI
Nip, Kameng; Wang, Zhenbo; Talla Nobibon, Fabrice; Leus, Roel A combination of flow shop scheduling and the shortest path problem. (English) Zbl 1328.90129 J. Comb. Optim. 29, No. 1, 36-52 (2015). MSC: 90C27 90B35 90C35 90C59 PDF BibTeX XML Cite \textit{K. Nip} et al., J. Comb. Optim. 29, No. 1, 36--52 (2015; Zbl 1328.90129) Full Text: DOI arXiv Link
Li, Wei-Xuan; Zhao, Chuan-Li Single machine scheduling problem with multiple due windows assignment in a group technology. (English) Zbl 1317.90124 J. Appl. Math. Comput. 48, No. 1-2, 477-494 (2015). MSC: 90B35 PDF BibTeX XML Cite \textit{W.-X. Li} and \textit{C.-L. Zhao}, J. Appl. Math. Comput. 48, No. 1--2, 477--494 (2015; Zbl 1317.90124) Full Text: DOI
Gharbi, Anis; Labidi, Mohamed; Louly, Mohamed Aly The nonpermutation flowshop scheduling problem: adjustment and bounding procedures. (English) Zbl 1437.90075 J. Appl. Math. 2014, Article ID 273567, 14 p. (2014). MSC: 90B35 PDF BibTeX XML Cite \textit{A. Gharbi} et al., J. Appl. Math. 2014, Article ID 273567, 14 p. (2014; Zbl 1437.90075) Full Text: DOI
Kooli, Anis; Serairi, Mehdi A mixed integer programming approach for the single machine problem with unequal release dates. (English) Zbl 1348.90281 Comput. Oper. Res. 51, 323-330 (2014). MSC: 90B35 90C11 90C57 PDF BibTeX XML Cite \textit{A. Kooli} and \textit{M. Serairi}, Comput. Oper. Res. 51, 323--330 (2014; Zbl 1348.90281) Full Text: DOI
Kolesov, N. V.; Tolmacheva, M. V.; Yukhta, P. V. Jitter minimization in scheduling computations in real-time systems. (English. Russian original) Zbl 1323.68055 Program. Comput. Softw. 40, No. 1, 28-34 (2014); translation from Programmirovanie 40, No. 1 (2014). MSC: 68M20 PDF BibTeX XML Cite \textit{N. V. Kolesov} et al., Program. Comput. Softw. 40, No. 1, 28--34 (2014; Zbl 1323.68055); translation from Programmirovanie 40, No. 1 (2014) Full Text: DOI
Stanford, David A.; Taylor, Peter; Ziedins, Ilze Waiting time distributions in the accumulating priority queue. (English) Zbl 1307.60136 Queueing Syst. 77, No. 3, 297-330 (2014). MSC: 60K25 90B22 68M20 PDF BibTeX XML Cite \textit{D. A. Stanford} et al., Queueing Syst. 77, No. 3, 297--330 (2014; Zbl 1307.60136) Full Text: DOI
Waligóra, Grzegorz Discrete-continuous project scheduling with discounted cash inflows and various payment models – a review of recent results. (English) Zbl 1296.90061 Ann. Oper. Res. 213, 319-340 (2014). MSC: 90B35 PDF BibTeX XML Cite \textit{G. Waligóra}, Ann. Oper. Res. 213, 319--340 (2014; Zbl 1296.90061) Full Text: DOI
Li, Song-Song; Zhang, Yu-Zhong Serial batch scheduling on uniform parallel machines to minimize total completion time. (English) Zbl 1371.90058 Inf. Process. Lett. 114, No. 12, 692-695 (2014). MSC: 90B35 68W40 PDF BibTeX XML Cite \textit{S.-S. Li} and \textit{Y.-Z. Zhang}, Inf. Process. Lett. 114, No. 12, 692--695 (2014; Zbl 1371.90058) Full Text: DOI
Dȩbczyński, Marek Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints. (English) Zbl 1288.90115 Optim. Lett. 8, No. 1, 395-400 (2014). MSC: 90C35 PDF BibTeX XML Cite \textit{M. Dȩbczyński}, Optim. Lett. 8, No. 1, 395--400 (2014; Zbl 1288.90115) Full Text: DOI
Adamu, Muminu O.; Adewumi, Aderemi O. A survey of single machine scheduling to minimize weighted number of tardy jobs. (English) Zbl 1276.90001 J. Ind. Manag. Optim. 10, No. 1, 219-241 (2014). MSC: 90-02 90C59 68W25 62L20 90B35 90B36 68T20 53C35 PDF BibTeX XML Cite \textit{M. O. Adamu} and \textit{A. O. Adewumi}, J. Ind. Manag. Optim. 10, No. 1, 219--241 (2014; Zbl 1276.90001) Full Text: DOI
Pan, Quan-Ke; Ruiz, Rubén A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. (English) Zbl 1349.90386 Comput. Oper. Res. 40, No. 1, 117-128 (2013). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{Q.-K. Pan} and \textit{R. Ruiz}, Comput. Oper. Res. 40, No. 1, 117--128 (2013; Zbl 1349.90386) Full Text: DOI Link
Haouari, Mohamed; Kharbeche, Mohamed An assignment-based lower bound for a class of two-machine flow shop problems. (English) Zbl 1348.90269 Comput. Oper. Res. 40, No. 7, 1693-1699 (2013). MSC: 90B35 PDF BibTeX XML Cite \textit{M. Haouari} and \textit{M. Kharbeche}, Comput. Oper. Res. 40, No. 7, 1693--1699 (2013; Zbl 1348.90269) Full Text: DOI
Sidorenko, A. M.; Khobotov, E. N. Aggregation in job scheduling in machine works. (English. Russian original) Zbl 1308.90067 J. Comput. Syst. Sci. Int. 52, No. 5, 800-810 (2013); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2013, No. 5, 132-144 (2013). MSC: 90B35 PDF BibTeX XML Cite \textit{A. M. Sidorenko} and \textit{E. N. Khobotov}, J. Comput. Syst. Sci. Int. 52, No. 5, 800--810 (2013; Zbl 1308.90067); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2013, No. 5, 132--144 (2013) Full Text: DOI
Agapeevich, I. K.; Fazylov, V. R. Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem. (English. Russian original) Zbl 1284.90020 Lobachevskii J. Math. 34, No. 4, 359-367 (2013); translation from Uch. Zap. Kazan. Univ., Ser. Fiz-Mat. Nauki 154, No. 3, 180-189 (2012). MSC: 90B35 90C57 PDF BibTeX XML Cite \textit{I. K. Agapeevich} and \textit{V. R. Fazylov}, Lobachevskii J. Math. 34, No. 4, 359--367 (2013; Zbl 1284.90020); translation from Uch. Zap. Kazan. Univ., Ser. Fiz-Mat. Nauki 154, No. 3, 180--189 (2012) Full Text: DOI
Reidenbach, Daniel; Schmid, Markus L. Finding shuffle words that represent optimal scheduling of shared memory access. (English) Zbl 1286.68242 Int. J. Comput. Math. 90, No. 6, 1292-1309 (2013). MSC: 68Q25 68Q42 90B35 90C27 PDF BibTeX XML Cite \textit{D. Reidenbach} and \textit{M. L. Schmid}, Int. J. Comput. Math. 90, No. 6, 1292--1309 (2013; Zbl 1286.68242) Full Text: DOI Link
Perel, Nir; Yechiali, Uri The Israeli Queue with priorities. (English) Zbl 1274.60277 Stoch. Models 29, No. 3, 353-379 (2013). MSC: 60K25 90B22 PDF BibTeX XML Cite \textit{N. Perel} and \textit{U. Yechiali}, Stoch. Models 29, No. 3, 353--379 (2013; Zbl 1274.60277) Full Text: DOI
Ata, Barış; Tongarlak, Mustafa H. On scheduling a multiclass queue with abandonments under general delay costs. (English) Zbl 1274.60268 Queueing Syst. 74, No. 1, 65-104 (2013). Reviewer: Jerzy Martyna (Kraków) MSC: 60K25 90B36 90B22 68M20 PDF BibTeX XML Cite \textit{B. Ata} and \textit{M. H. Tongarlak}, Queueing Syst. 74, No. 1, 65--104 (2013; Zbl 1274.60268) Full Text: DOI
Golosov, P. E.; Kozlov, M. V.; Malashenko, Yu. E.; Nazarova, I. A.; Ronzhin, A. F. Analysis of computer job control under uncertainty. (English. Russian original) Zbl 1307.93265 J. Comput. Syst. Sci. Int. 51, No. 1, 49-64 (2012); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2012, No. 1, 50-66 (2012). MSC: 93C83 68M20 PDF BibTeX XML Cite \textit{P. E. Golosov} et al., J. Comput. Syst. Sci. Int. 51, No. 1, 49--64 (2012; Zbl 1307.93265); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2012, No. 1, 50--66 (2012) Full Text: DOI
Gordon, V. S.; Kovalyov, M. Y.; Levin, G. M.; Shafransky, Y. M.; Sotskov, Y. N.; Strusevich, V. A.; Tuzikov, A. V. [Tanaev, Vyacheslav] Vyacheslav Tanaev: contributions to scheduling and related areas. (English) Zbl 1280.90048 J. Sched. 15, No. 4, 403-418 (2012). MSC: 90B35 01A70 PDF BibTeX XML Cite \textit{V. S. Gordon} et al., J. Sched. 15, No. 4, 403--418 (2012; Zbl 1280.90048) Full Text: DOI
Jouglet, Antoine Single-machine scheduling with no idle time and release dates to minimize a regular criterion. (English) Zbl 1280.90053 J. Sched. 15, No. 2, 217-238 (2012). MSC: 90B35 PDF BibTeX XML Cite \textit{A. Jouglet}, J. Sched. 15, No. 2, 217--238 (2012; Zbl 1280.90053) Full Text: DOI HAL
Kolesov, N. V.; Tolmacheva, M. V.; Yukhta, P. V. Scheduling of computational processes in real-time distributed systems with uncertain task execution times. (English. Russian original) Zbl 1282.90071 J. Comput. Syst. Sci. Int. 51, No. 5, 636-647 (2012); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2012, No. 5, 23-34 (2012). MSC: 90B35 93C83 65G40 PDF BibTeX XML Cite \textit{N. V. Kolesov} et al., J. Comput. Syst. Sci. Int. 51, No. 5, 636--647 (2012; Zbl 1282.90071); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2012, No. 5, 23--34 (2012) Full Text: DOI
Kramer, Steven B.; Assad, Arjang A. Alternating priority versus FCFS scheduling in a two-class queueing system. (English) Zbl 1262.90045 Oper. Res. Lett. 40, No. 6, 506-509 (2012). MSC: 90B22 90B36 PDF BibTeX XML Cite \textit{S. B. Kramer} and \textit{A. A. Assad}, Oper. Res. Lett. 40, No. 6, 506--509 (2012; Zbl 1262.90045) Full Text: DOI
Baptiste, Ph.; Carlier, J.; Kononov, A.; Queyranne, M.; Sevastyanov, S.; Sviridenko, M. Integer preemptive scheduling on parallel machines. (English) Zbl 1258.90035 Oper. Res. Lett. 40, No. 6, 440-444 (2012). MSC: 90B35 PDF BibTeX XML Cite \textit{Ph. Baptiste} et al., Oper. Res. Lett. 40, No. 6, 440--444 (2012; Zbl 1258.90035) Full Text: DOI
Rustogi, Kabir; Strusevich, Vitaly A. Simple matching vs linear assignment in scheduling models with positional effects: a critical review. (English) Zbl 1253.90117 Eur. J. Oper. Res. 222, No. 3, 393-407 (2012). MSC: 90B35 PDF BibTeX XML Cite \textit{K. Rustogi} and \textit{V. A. Strusevich}, Eur. J. Oper. Res. 222, No. 3, 393--407 (2012; Zbl 1253.90117) Full Text: DOI
Della Croce, F.; Koulamas, C. A note on minimizing the sum of quadratic completion times on two identical parallel machines. (English) Zbl 1248.68111 Inf. Process. Lett. 112, No. 19, 738-742 (2012). MSC: 68M20 PDF BibTeX XML Cite \textit{F. Della Croce} and \textit{C. Koulamas}, Inf. Process. Lett. 112, No. 19, 738--742 (2012; Zbl 1248.68111) Full Text: DOI
Xiao, Yi-Yong; Zhang, Ren-Qian; Zhao, Qiu-Hong; Kaku, Ikou Permutation flow shop scheduling with order acceptance and weighted tardiness. (English) Zbl 1237.90101 Appl. Math. Comput. 218, No. 15, 7911-7926 (2012). MSC: 90B35 PDF BibTeX XML Cite \textit{Y.-Y. Xiao} et al., Appl. Math. Comput. 218, No. 15, 7911--7926 (2012; Zbl 1237.90101) Full Text: DOI
Georgiadis, Patroklos; Michaloudis, Charalampos Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis. (English) Zbl 1237.90073 Eur. J. Oper. Res. 216, No. 1, 94-104 (2012). MSC: 90B30 PDF BibTeX XML Cite \textit{P. Georgiadis} and \textit{C. Michaloudis}, Eur. J. Oper. Res. 216, No. 1, 94--104 (2012; Zbl 1237.90073) Full Text: DOI
Khobotov, E. N. Problems and methods for multiproduct inventory control in production conditions. (English. Russian original) Zbl 1275.93052 J. Comput. Syst. Sci. Int. 50, No. 6, 1019-1030 (2011); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2011, No. 6, 165-176 (2011). MSC: 93C95 90B05 49N90 93E03 PDF BibTeX XML Cite \textit{E. N. Khobotov}, J. Comput. Syst. Sci. Int. 50, No. 6, 1019--1030 (2011; Zbl 1275.93052); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2011, No. 6, 165--176 (2011) Full Text: DOI
Li, Jinquan; Yuan, Xuehai; Lee, E. S.; Xu, Dehua Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine. (English) Zbl 1236.90054 Comput. Math. Appl. 62, No. 11, 4126-4139 (2011). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{J. Li} et al., Comput. Math. Appl. 62, No. 11, 4126--4139 (2011; Zbl 1236.90054) Full Text: DOI
Lee, Kangbok; Leung, Joseph Y-T.; Pinedo, Michael L. Coordination mechanisms with hybrid local policies. (English) Zbl 1235.90065 Discrete Optim. 8, No. 4, 513-524 (2011). MSC: 90B35 PDF BibTeX XML Cite \textit{K. Lee} et al., Discrete Optim. 8, No. 4, 513--524 (2011; Zbl 1235.90065) Full Text: DOI
Gawiejnowicz, Stanisław; Lai, Tsung-Chyan; Chiang, Ming-Huang Scheduling linearly shortening jobs under precedence constraints. (English) Zbl 1217.90104 Appl. Math. Modelling 35, No. 4, 2005-2015 (2011). MSC: 90B35 90C35 PDF BibTeX XML Cite \textit{S. Gawiejnowicz} et al., Appl. Math. Modelling 35, No. 4, 2005--2015 (2011; Zbl 1217.90104) Full Text: DOI
Jouglet, Antoine; Savourey, David Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates. (English) Zbl 1208.90066 Comput. Oper. Res. 38, No. 9, 1259-1266 (2011). MSC: 90B35 PDF BibTeX XML Cite \textit{A. Jouglet} and \textit{D. Savourey}, Comput. Oper. Res. 38, No. 9, 1259--1266 (2011; Zbl 1208.90066) Full Text: DOI
Werner, F.; Lazarev, A. Foreword to the thematical issue devoted to the seventieth anniversary of Academician V. S. Tanaev. (English. Russian original) Zbl 1203.93003 Autom. Remote Control 71, No. 10, 2019-2020 (2010); translation from Avtom. Telemekh. 2010, No. 10, 3-5 (2010). MSC: 93-03 93C83 90B35 PDF BibTeX XML Cite \textit{F. Werner} and \textit{A. Lazarev}, Autom. Remote Control 71, No. 10, 2019--2020 (2010; Zbl 1203.93003); translation from Avtom. Telemekh. 2010, No. 10, 3--5 (2010) Full Text: DOI
Nazarathy, Yoni; Weiss, Gideon A fluid approach to large volume job shop scheduling. (English) Zbl 1201.90084 J. Sched. 13, No. 5, 509-529 (2010). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{Y. Nazarathy} and \textit{G. Weiss}, J. Sched. 13, No. 5, 509--529 (2010; Zbl 1201.90084) Full Text: DOI
Shabtay, Dvir; Steiner, George; Yedidsion, Liron Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments. (English) Zbl 1230.90101 Discrete Appl. Math. 158, No. 10, 1090-1103 (2010). MSC: 90B35 68Q17 90B80 PDF BibTeX XML Cite \textit{D. Shabtay} et al., Discrete Appl. Math. 158, No. 10, 1090--1103 (2010; Zbl 1230.90101) Full Text: DOI
Mateus, Geraldo R.; Ravetti, Martín G.; de Souza, Maurício C.; Valeriano, Taís M. Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration. (English) Zbl 1193.90104 J. Sched. 13, No. 3, 245-259 (2010). MSC: 90B35 90C05 90C59 PDF BibTeX XML Cite \textit{G. R. Mateus} et al., J. Sched. 13, No. 3, 245--259 (2010; Zbl 1193.90104) Full Text: DOI
Bukchin, Yossi; Masin, Michael; Kirshner, Rinat Modeling and analysis of multiobjective lot splitting for \(N\)-product \(M\)-machine flowshop lines. (English) Zbl 1186.90060 Nav. Res. Logist. 57, No. 4, 354-366 (2010). MSC: 90B50 PDF BibTeX XML Cite \textit{Y. Bukchin} et al., Nav. Res. Logist. 57, No. 4, 354--366 (2010; Zbl 1186.90060) Full Text: DOI
Yang, Jaehwan; Posner, Marc E. Flow shops with WIP and value added costs. (English) Zbl 1185.90102 J. Sched. 13, No. 1, 3-16 (2010); erratum ibid. 18, No. 3, 331 (2015). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{J. Yang} and \textit{M. E. Posner}, J. Sched. 13, No. 1, 3--16 (2010; Zbl 1185.90102) Full Text: DOI
Yang, Shengxiang; Wang, Dingwei; Chai, Tianyou; Kendall, Graham An improved constraint satisfaction adaptive neural network for job-shop scheduling. (English) Zbl 1185.90103 J. Sched. 13, No. 1, 17-38 (2010). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{S. Yang} et al., J. Sched. 13, No. 1, 17--38 (2010; Zbl 1185.90103) Full Text: DOI Link
Gawiejnowicz, Stanisław; Lin, Bertrand M. T. Scheduling time-dependent jobs under mixed deterioration. (English) Zbl 1188.90095 Appl. Math. Comput. 216, No. 2, 438-447 (2010). MSC: 90B35 PDF BibTeX XML Cite \textit{S. Gawiejnowicz} and \textit{B. M. T. Lin}, Appl. Math. Comput. 216, No. 2, 438--447 (2010; Zbl 1188.90095) Full Text: DOI
Balasubramanian, Hari; Fowler, John; Keha, Ahmet; Pfund, Michele Scheduling interfering job sets on parallel machines. (English) Zbl 1176.90193 Eur. J. Oper. Res. 199, No. 1, 55-67 (2009). MSC: 90B35 PDF BibTeX XML Cite \textit{H. Balasubramanian} et al., Eur. J. Oper. Res. 199, No. 1, 55--67 (2009; Zbl 1176.90193) Full Text: DOI
Filippi, Carlo; Romanin-Jacur, Giorgio Exact and approximate algorithms for high-multiplicity parallel machine scheduling. (English) Zbl 1176.90209 J. Sched. 12, No. 5, 529-541 (2009). MSC: 90B35 PDF BibTeX XML Cite \textit{C. Filippi} and \textit{G. Romanin-Jacur}, J. Sched. 12, No. 5, 529--541 (2009; Zbl 1176.90209) Full Text: DOI
Gawiejnowicz, Stanisław; Kurc, Wiesław; Pankowska, Lidia Conjugate problems in time-dependent scheduling. (English) Zbl 1176.90212 J. Sched. 12, No. 5, 543-553 (2009). MSC: 90B35 PDF BibTeX XML Cite \textit{S. Gawiejnowicz} et al., J. Sched. 12, No. 5, 543--553 (2009; Zbl 1176.90212) Full Text: DOI
Benli, ömer S. Event-time models for supply chain scheduling. (English) Zbl 1172.90395 Chaovalitwongse, Wanpracha (ed.) et al., Optimization and logistics challenges in the enterprise. New York, NY: Springer (ISBN 978-0-387-88616-9/hbk; 978-0-387-88617-6/ebook). Springer Optimization and Its Applications 30, 255-275 (2009). MSC: 90B35 90B06 PDF BibTeX XML Cite \textit{ö. S. Benli}, Springer Optim. Appl. 30, 255--275 (2009; Zbl 1172.90395) Full Text: DOI
Birch, David The dynamics of the stream of behavior. (English) Zbl 1159.91478 J. Math. Psychol. 53, No. 2, 106-118 (2009). MSC: 91E45 PDF BibTeX XML Cite \textit{D. Birch}, J. Math. Psychol. 53, No. 2, 106--118 (2009; Zbl 1159.91478) Full Text: DOI
Levin, Asaf; Mosheiov, Gur; Sarig, Assaf Scheduling a maintenance activity on parallel identical machines. (English) Zbl 1158.90350 Nav. Res. Logist. 56, No. 1, 33-41 (2009). MSC: 90B35 90C39 PDF BibTeX XML Cite \textit{A. Levin} et al., Nav. Res. Logist. 56, No. 1, 33--41 (2009; Zbl 1158.90350) Full Text: DOI
Kim, Eun-Seok; Sung, Chang-Sup; Lee, Ik-Sun Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints. (English) Zbl 1163.90006 Comput. Oper. Res. 36, No. 3, 698-710 (2009). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{E.-S. Kim} et al., Comput. Oper. Res. 36, No. 3, 698--710 (2009; Zbl 1163.90006) Full Text: DOI
Yang, Jaehwan Two machine flow shop scheduling problem with weighted WIP costs. (English) Zbl 1163.90009 Comput. Oper. Res. 36, No. 2, 472-486 (2009). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{J. Yang}, Comput. Oper. Res. 36, No. 2, 472--486 (2009; Zbl 1163.90009) Full Text: DOI
Su, Ling-Huey Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system. (English) Zbl 1163.90008 Comput. Oper. Res. 36, No. 2, 461-471 (2009). MSC: 90B35 PDF BibTeX XML Cite \textit{L.-H. Su}, Comput. Oper. Res. 36, No. 2, 461--471 (2009; Zbl 1163.90008) Full Text: DOI
Jin, Feng; Gupta, Jatinder N. D.; Song, Shi-ji; Wu, Cheng Makespan distribution of permutation flowshop schedules. (English) Zbl 1168.90446 J. Sched. 11, No. 6, 421-432 (2008). MSC: 90B35 PDF BibTeX XML Cite \textit{F. Jin} et al., J. Sched. 11, No. 6, 421--432 (2008; Zbl 1168.90446) Full Text: DOI
Shabtay, Dvir; Steiner, George Optimal due date assignment in multi-machine scheduling environments. (English) Zbl 1168.90470 J. Sched. 11, No. 3, 217-228 (2008). MSC: 90B35 90B80 PDF BibTeX XML Cite \textit{D. Shabtay} and \textit{G. Steiner}, J. Sched. 11, No. 3, 217--228 (2008; Zbl 1168.90470) Full Text: DOI
Aalto, Samuli; Ayesta, Urtzi Recent sojourn time results for multilevel processor-sharing scheduling disciplines. (English) Zbl 1146.60072 Stat. Neerl. 62, No. 3, 266-282 (2008). MSC: 60K25 90B22 68M20 PDF BibTeX XML Cite \textit{S. Aalto} and \textit{U. Ayesta}, Stat. Neerl. 62, No. 3, 266--282 (2008; Zbl 1146.60072) Full Text: DOI
Artigues, Christian; Feillet, Dominique A branch and bound method for the job-shop problem with sequence-dependent setup times. (English) Zbl 1152.90424 Ann. Oper. Res. 159, 135-159 (2008). MSC: 90B35 90C57 90C39 PDF BibTeX XML Cite \textit{C. Artigues} and \textit{D. Feillet}, Ann. Oper. Res. 159, 135--159 (2008; Zbl 1152.90424) Full Text: DOI HAL
Angel, Eric; Bampis, Evripidis; Pascual, Fanny How good are SPT schedules for fair optimality criteria. (English) Zbl 1152.90422 Ann. Oper. Res. 159, 53-64 (2008). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{E. Angel} et al., Ann. Oper. Res. 159, 53--64 (2008; Zbl 1152.90422) Full Text: DOI