Grigoreva, Natalia Scheduling algorithms for single machine problem with release and delivery times. (English) Zbl 1522.90016 Fidanova, Stefka (ed.), Recent advances in computational optimization. Results of the workshop on computational optimization, WCO 2021. Cham: Springer. Stud. Comput. Intell. 1044, 61-77 (2022). MSC: 90B35 PDFBibTeX XMLCite \textit{N. Grigoreva}, Stud. Comput. Intell. 1044, 61--77 (2022; Zbl 1522.90016) Full Text: DOI
Hu, Kanxin; Che, Yuxin; Zhang, Zhenzhen Scheduling unrelated additive manufacturing machines with practical constraints. (English) Zbl 1520.90109 Comput. Oper. Res. 144, Article ID 105847, 16 p. (2022). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{K. Hu} et al., Comput. Oper. Res. 144, Article ID 105847, 16 p. (2022; Zbl 1520.90109) Full Text: DOI
Gupta, Varun; Moseley, Benjamin; Uetz, Marc; Xie, Qiaomin Corrigendum to: “Greed works – online algorithms for unrelated machine stochastic scheduling”. (English) Zbl 1479.90110 Math. Oper. Res. 46, No. 3, 1230-1234 (2021). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 90B36 68M20 68W27 90C27 90C59 PDFBibTeX XMLCite \textit{V. Gupta} et al., Math. Oper. Res. 46, No. 3, 1230--1234 (2021; Zbl 1479.90110) Full Text: DOI
Pei, Jun; Song, Qingru; Liao, Baoyu; Liu, Xinbao; Pardalos, Panos M. Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration. (English) Zbl 1467.90011 Ann. Oper. Res. 298, No. 1-2, 407-444 (2021). MSC: 90B35 PDFBibTeX XMLCite \textit{J. Pei} et al., Ann. Oper. Res. 298, No. 1--2, 407--444 (2021; Zbl 1467.90011) Full Text: DOI
Hassoun, Michael; Shoval, Shraga; Simchon, Eran; Yedidsion, Liron The single line moving target traveling salesman problem with release times. (English) Zbl 1496.90077 Ann. Oper. Res. 289, No. 2, 449-458 (2020). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{M. Hassoun} et al., Ann. Oper. Res. 289, No. 2, 449--458 (2020; Zbl 1496.90077) Full Text: DOI
Li, Yijie; Li, Shuguang Scheduling jobs with sizes and delivery times on identical parallel batch machines. (English) Zbl 1455.90070 Theor. Comput. Sci. 841, 1-9 (2020). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{Y. Li} and \textit{S. Li}, Theor. Comput. Sci. 841, 1--9 (2020; Zbl 1455.90070) Full Text: DOI
Kolev, Aleksandar A.; Ross, Gordon J. Inference for ETAS models with non-Poissonian mainshock arrival times. (English) Zbl 1430.62136 Stat. Comput. 29, No. 5, 915-931 (2019). MSC: 62H30 60G55 65C05 PDFBibTeX XMLCite \textit{A. A. Kolev} and \textit{G. J. Ross}, Stat. Comput. 29, No. 5, 915--931 (2019; Zbl 1430.62136) Full Text: DOI
Yan, Ping; Wang, Ji-Bo; Zhao, Li-Qiang Single-machine bi-criterion scheduling with release times and exponentially time-dependent learning effects. (English) Zbl 1438.90123 J. Ind. Manag. Optim. 15, No. 3, 1117-1131 (2019). MSC: 90B35 90C57 90C59 68T05 PDFBibTeX XMLCite \textit{P. Yan} et al., J. Ind. Manag. Optim. 15, No. 3, 1117--1131 (2019; Zbl 1438.90123) Full Text: DOI
Kacem, Imed; Kellerer, Hans Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints. (English) Zbl 1404.90075 Algorithmica 80, No. 12, 3825-3843 (2018). MSC: 90B35 68W25 90C59 PDFBibTeX XMLCite \textit{I. Kacem} and \textit{H. Kellerer}, Algorithmica 80, No. 12, 3825--3843 (2018; Zbl 1404.90075) Full Text: DOI arXiv
van Bevern, René; Niedermeier, Rolf; Suchý, Ondřej A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. (English) Zbl 1376.90028 J. Sched. 20, No. 3, 255-265 (2017). MSC: 90B35 68M20 90C59 PDFBibTeX XMLCite \textit{R. van Bevern} et al., J. Sched. 20, No. 3, 255--265 (2017; Zbl 1376.90028) Full Text: DOI arXiv
Zhong, Xueling; Pan, Zhangming; Jiang, Dakui Scheduling with release times and rejection on two parallel machines. (English) Zbl 1372.90056 J. Comb. Optim. 33, No. 3, 934-944 (2017). MSC: 90B35 PDFBibTeX XMLCite \textit{X. Zhong} et al., J. Comb. Optim. 33, No. 3, 934--944 (2017; Zbl 1372.90056) Full Text: DOI
Jia, Zhao-Hong; Wen, Ting-Ting; Leung, Joseph Y.-T.; Li, Kai Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times. (English) Zbl 1364.90371 J. Ind. Manag. Optim. 13, No. 2, 977-993 (2017). MSC: 90C59 90B36 PDFBibTeX XMLCite \textit{Z.-H. Jia} et al., J. Ind. Manag. Optim. 13, No. 2, 977--993 (2017; Zbl 1364.90371) Full Text: DOI
Wu, Hua-Ping; Huang, Min; Ip, W. H.; Fan, Qun-Lin Algorithms for single-machine scheduling problem with deterioration depending on a novel model. (English) Zbl 1364.90181 J. Ind. Manag. Optim. 13, No. 2, 681-695 (2017). MSC: 90B50 90B36 62P30 PDFBibTeX XMLCite \textit{H.-P. Wu} et al., J. Ind. Manag. Optim. 13, No. 2, 681--695 (2017; Zbl 1364.90181) Full Text: DOI
Vélez-Gallego, Mario C.; Maya, Jairo; Montoya-Torres, Jairo R. A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan. (English) Zbl 1349.90405 Comput. Oper. Res. 73, 132-140 (2016). MSC: 90B35 68M20 90C59 PDFBibTeX XMLCite \textit{M. C. Vélez-Gallego} et al., Comput. Oper. Res. 73, 132--140 (2016; Zbl 1349.90405) Full Text: DOI
Dover, Omri; Shabtay, Dvir Single machine scheduling with two competing agents, arbitrary release dates and unit processing times. (English) Zbl 1334.90049 Ann. Oper. Res. 238, No. 1-2, 145-178 (2016). MSC: 90B35 PDFBibTeX XMLCite \textit{O. Dover} and \textit{D. Shabtay}, Ann. Oper. Res. 238, No. 1--2, 145--178 (2016; Zbl 1334.90049) Full Text: DOI
Pei, Jun; Liu, Xinbao; Pardalos, Panos M.; Fan, Wenjuan; Wang, Ling; Yang, Shanlin Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm. (English) Zbl 1333.90052 Int. J. Syst. Sci., Princ. Appl. Syst. Integr. 47, No. 4, 765-776 (2016). MSC: 90B35 91B60 90C11 68Q25 90C59 PDFBibTeX XMLCite \textit{J. Pei} et al., Int. J. Syst. Sci., Princ. Appl. Syst. Integr. 47, No. 4, 765--776 (2016; Zbl 1333.90052) Full Text: DOI
Batsyn, Mikhail; Goldengorin, Boris; Sukhov, Pavel; Pardalos, Panos M. Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times. (English) Zbl 1344.90020 Goldengorin, Boris I. (ed.) et al., Models, algorithms, and technologies for network analysis. Proceedings of the second international conference on network analysis, Nizhny Novgorod, Russia, May 7–9, 2012. New York, NY: Springer (ISBN 978-1-4614-8587-2/hbk; 978-1-4614-8588-9/ebook). Springer Proceedings in Mathematics & Statistics 59, 11-27 (2013). MSC: 90B35 PDFBibTeX XMLCite \textit{M. Batsyn} et al., Springer Proc. Math. Stat. 59, 11--27 (2013; Zbl 1344.90020) Full Text: DOI
Selvarajah, Esaignani; Steiner, George; Zhang, Rui Single machine batch scheduling with release times and delivery costs. (English) Zbl 1297.90057 J. Sched. 16, No. 1, 69-79 (2013). MSC: 90B35 PDFBibTeX XMLCite \textit{E. Selvarajah} et al., J. Sched. 16, No. 1, 69--79 (2013; Zbl 1297.90057) Full Text: DOI
Garcia, Christopher; Rabadi, Ghaith Exact and approximate methods for parallel multiple-area spatial scheduling with release times. (English) Zbl 1282.90068 OR Spectrum 35, No. 3, 639-657 (2013). MSC: 90B35 90C10 PDFBibTeX XMLCite \textit{C. Garcia} and \textit{G. Rabadi}, OR Spectrum 35, No. 3, 639--657 (2013; Zbl 1282.90068) Full Text: DOI
Yaman, Hande; Karasan, Oya Ekin; Kara, Bahar Y. Release time scheduling and hub location for next-day delivery. (English) Zbl 1260.90101 Oper. Res. 60, No. 4, 906-917 (2012). MSC: 90B35 90B80 90C10 PDFBibTeX XMLCite \textit{H. Yaman} et al., Oper. Res. 60, No. 4, 906--917 (2012; Zbl 1260.90101) Full Text: DOI Link
Liu, Ming; Zheng, Feifeng; Chu, Chengbin; Xu, Yinfeng Scheduling deteriorating jobs on a single machine with release times and rejection. (English) Zbl 1254.90072 Discrete Math. Algorithms Appl. 4, No. 2, 1250032, 9 p. (2012). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{M. Liu} et al., Discrete Math. Algorithms Appl. 4, No. 2, 1250032, 9 p. (2012; Zbl 1254.90072) Full Text: DOI
Wagneur, Edouard; Cheng, Edwin; Ng, Daniel A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem. (English) Zbl 1218.90080 Discrete Appl. Math. 159, No. 13, 1367-1376 (2011). MSC: 90B35 PDFBibTeX XMLCite \textit{E. Wagneur} et al., Discrete Appl. Math. 159, No. 13, 1367--1376 (2011; Zbl 1218.90080) Full Text: DOI
Toksarı, M. Duran A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs. (English) Zbl 1208.90080 Comput. Oper. Res. 38, No. 9, 1361-1365 (2011). MSC: 90B35 90C57 90C59 PDFBibTeX XMLCite \textit{M. D. Toksarı}, Comput. Oper. Res. 38, No. 9, 1361--1365 (2011; Zbl 1208.90080) Full Text: DOI
Zinder, Yakov; Su, Bo; Singh, Gaurav; Sorli, Ron Scheduling UET-UCT tasks: Branch-and-bound search in the priority space. (English) Zbl 1239.90055 Optim. Eng. 11, No. 4, 627-646 (2010). MSC: 90B35 90C27 PDFBibTeX XMLCite \textit{Y. Zinder} et al., Optim. Eng. 11, No. 4, 627--646 (2010; Zbl 1239.90055) Full Text: DOI
Gharbi, Anis; Labidi, Mohamed Jackson’s semi-preemptive scheduling on a single machine. (English) Zbl 1231.90193 Comput. Oper. Res. 37, No. 12, 2082-2088 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{A. Gharbi} and \textit{M. Labidi}, Comput. Oper. Res. 37, No. 12, 2082--2088 (2010; Zbl 1231.90193) Full Text: DOI
Shi, Ling; Xu, Chun; Cheng, Xue-Guang Complexity of minimize total weighted average completion time scheduling problems with release times. (English) Zbl 1188.90111 Appl. Math. Sci., Ruse 4, No. 5-8, 381-391 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{L. Shi} et al., Appl. Math. Sci., Ruse 4, No. 5--8, 381--391 (2010; Zbl 1188.90111) Full Text: Link
Li, Chung-Lun; Wang, Xiuli Scheduling parallel machines with inclusive processing set restrictions and job release times. (English) Zbl 1177.90170 Eur. J. Oper. Res. 200, No. 3, 702-710 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{C.-L. Li} and \textit{X. Wang}, Eur. J. Oper. Res. 200, No. 3, 702--710 (2010; Zbl 1177.90170) Full Text: DOI Link
Ahmadizar, Fardin; Ghazanfari, Mehdi; Fatemi Ghomi, Seyyed Mohammad Taghi Group shops scheduling with makespan criterion subject to random release dates and processing times. (English) Zbl 1171.90389 Comput. Oper. Res. 37, No. 1, 152-162 (2010). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{F. Ahmadizar} et al., Comput. Oper. Res. 37, No. 1, 152--162 (2010; Zbl 1171.90389) Full Text: DOI
Mathirajan, M.; Sivakumar, Appa Iyer Scheduling a burn-in oven with non-agreeable release times and due dates. (English) Zbl 1161.90534 Int. J. Oper. Res. 4, No. 3, 231-249 (2009). MSC: 90C59 PDFBibTeX XMLCite \textit{M. Mathirajan} and \textit{A. I. Sivakumar}, Int. J. Oper. Res. 4, No. 3, 231--249 (2009; Zbl 1161.90534) Full Text: DOI
Cheng, Zhenmin; Li, Hongxing An optimal algorithm for identical machine scheduling problem with preemption. (Chinese. English summary) Zbl 1183.90213 J. Beijing Norm. Univ., Nat. Sci. 44, No. 5, 465-468 (2008). MSC: 90B36 68M20 PDFBibTeX XMLCite \textit{Z. Cheng} and \textit{H. Li}, J. Beijing Norm. Univ., Nat. Sci. 44, No. 5, 465--468 (2008; Zbl 1183.90213)
Janiak, Adam; Janiak, Władysław; Lichtenstein, Maciej Resource management in machine scheduling problems: a survey. (English) Zbl 1231.90199 Decis. Mak. Manuf. Serv. 1, No. 1-2, 59-89 (2007). MSC: 90B35 90-02 PDFBibTeX XMLCite \textit{A. Janiak} et al., Decis. Mak. Manuf. Serv. 1, No. 1--2, 59--89 (2007; Zbl 1231.90199) Full Text: DOI
Haouari, M.; Ladhari, T. Minimizing maximum lateness in a flow shop subject to release dates. (English) Zbl 1152.90444 J. Oper. Res. Soc. 58, No. 1, 62-72 (2007). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{M. Haouari} and \textit{T. Ladhari}, J. Oper. Res. Soc. 58, No. 1, 62--72 (2007; Zbl 1152.90444) Full Text: DOI
Gharbi, Anis; Haouari, Mohamed An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. (English) Zbl 1120.90018 Comput. Oper. Res. 34, No. 3, 868-883 (2007). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{A. Gharbi} and \textit{M. Haouari}, Comput. Oper. Res. 34, No. 3, 868--883 (2007; Zbl 1120.90018) Full Text: DOI
Li, Shuguang; Li, Guojun; Wang, Xiuhong Minimizing total weighted completion time on parallel unbounded batch machines. (Chinese. English summary) Zbl 1122.68354 J. Softw. 17, No. 10, 2063-2068 (2006). MSC: 68M20 PDFBibTeX XMLCite \textit{S. Li} et al., J. Softw. 17, No. 10, 2063--2068 (2006; Zbl 1122.68354)
Shakhlevich, Natalia V.; Strusevich, Vitaly A. Single machine scheduling with controllable release and processing parameters. (English) Zbl 1111.90045 Discrete Appl. Math. 154, No. 15, 2178-2199 (2006). MSC: 90B35 90B30 90B06 PDFBibTeX XMLCite \textit{N. V. Shakhlevich} and \textit{V. A. Strusevich}, Discrete Appl. Math. 154, No. 15, 2178--2199 (2006; Zbl 1111.90045) Full Text: DOI
Cheng, T. C. Edwin; Kovalyov, Mikhail Y.; Shakhlevich, Natalia V. Scheduling with controllable release dates and processing times: total completion time minimization. (English) Zbl 1142.90396 Eur. J. Oper. Res. 175, No. 2, 769-781 (2006). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{T. C. E. Cheng} et al., Eur. J. Oper. Res. 175, No. 2, 769--781 (2006; Zbl 1142.90396) Full Text: DOI
Cheng, T. C. Edwin; Kovalyov, Mikhail Y.; Shakhlevich, Natalia V. Scheduling with controllable release dates and processing times: Makespan minimization. (English) Zbl 1142.90395 Eur. J. Oper. Res. 175, No. 2, 751-768 (2006). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{T. C. E. Cheng} et al., Eur. J. Oper. Res. 175, No. 2, 751--768 (2006; Zbl 1142.90395) Full Text: DOI
Li, Shuguang; Li, Guojun; Wang, Xiaoli; Liu, Qiming Minimizing makespan on a single batching machine with release times and non-identical job sizes. (English) Zbl 1099.90021 Oper. Res. Lett. 33, No. 2, 157-164 (2005). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{S. Li} et al., Oper. Res. Lett. 33, No. 2, 157--164 (2005; Zbl 1099.90021) Full Text: DOI
Chou, Fuh-Der; Chang, Tzu-Yun; Lee, Ching-En A heuristic algorithm to minimize total weighted tardiness on a single machine with release times. (English) Zbl 1063.90026 Int. Trans. Oper. Res. 12, No. 2, 215-233 (2005). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{F.-D. Chou} et al., Int. Trans. Oper. Res. 12, No. 2, 215--233 (2005; Zbl 1063.90026) Full Text: DOI
Cheng, T. C. E.; Yuan, J. J.; Yang, A. F. Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. (English) Zbl 1071.90528 Comput. Oper. Res. 32, No. 4, 849-859 (2005). MSC: 90B35 68M20 90C39 90C59 68W25 PDFBibTeX XMLCite \textit{T. C. E. Cheng} et al., Comput. Oper. Res. 32, No. 4, 849--859 (2005; Zbl 1071.90528) Full Text: DOI Link
Wang, Xiuli; Cheng, T. C. E. Single machine scheduling with resource dependent release times and processing times. (English) Zbl 1065.90045 Eur. J. Oper. Res. 162, No. 3, 727-739 (2005). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{X. Wang} and \textit{T. C. E. Cheng}, Eur. J. Oper. Res. 162, No. 3, 727--739 (2005; Zbl 1065.90045) Full Text: DOI Link
Haouari, Mohamed; Gharbi, Anis Lower bounds for scheduling on identical parallel machines with heads and tails. (English) Zbl 1056.90065 Ann. Oper. Res. 129, 187-204 (2004). MSC: 90B35 PDFBibTeX XMLCite \textit{M. Haouari} and \textit{A. Gharbi}, Ann. Oper. Res. 129, 187--204 (2004; Zbl 1056.90065) Full Text: DOI
Aloulou, Mohamed Ali; Kovalyov, Mikhail Y.; Portmann, Marie-Claude Maximization problems in single machine scheduling. (English) Zbl 1056.90050 Ann. Oper. Res. 129, 21-32 (2004). MSC: 90B35 PDFBibTeX XMLCite \textit{M. A. Aloulou} et al., Ann. Oper. Res. 129, 21--32 (2004; Zbl 1056.90050) Full Text: DOI
Péridy, Laurent; Pinson, Éric; Rivreau, David Using short-term memory to minimize the weighted number of late jobs on a single machine. (English) Zbl 1037.90033 Eur. J. Oper. Res. 148, No. 3, 591-603 (2003). MSC: 90B35 90C57 90C39 PDFBibTeX XMLCite \textit{L. Péridy} et al., Eur. J. Oper. Res. 148, No. 3, 591--603 (2003; Zbl 1037.90033) Full Text: DOI
Qi, Xiangtong; Yu, Gang; Bard, Jonathan F. Single machine scheduling with assignable due dates. (English) Zbl 1019.90024 Discrete Appl. Math. 122, No. 1-3, 211-233 (2002). MSC: 90B35 90B80 65Y20 PDFBibTeX XMLCite \textit{X. Qi} et al., Discrete Appl. Math. 122, No. 1--3, 211--233 (2002; Zbl 1019.90024) Full Text: DOI
Gharbi, Anis; Haouari, Mohamed Minimizing makespan on parallel machines subject to release dates and delivery times. (English) Zbl 1009.90047 J. Sched. 5, No. 4, 329-355 (2002). MSC: 90B35 90C57 68M20 PDFBibTeX XMLCite \textit{A. Gharbi} and \textit{M. Haouari}, J. Sched. 5, No. 4, 329--355 (2002; Zbl 1009.90047) Full Text: DOI
Cheng, Jinliang; Steiner, George; Stephenson, Paul Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (English) Zbl 1115.90336 J. Sched. 5, No. 1, 71-92 (2002). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{J. Cheng} et al., J. Sched. 5, No. 1, 71--92 (2002; Zbl 1115.90336) Full Text: DOI
Cheng, Jinliang; Steiner, George; Stephenson, Paul A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. (English) Zbl 0983.90019 Eur. J. Oper. Res. 130, No. 3, 559-575 (2001). MSC: 90B35 90C57 90B40 PDFBibTeX XMLCite \textit{J. Cheng} et al., Eur. J. Oper. Res. 130, No. 3, 559--575 (2001; Zbl 0983.90019) Full Text: DOI
Bar-Noy, Amotz; Bar-Yehuda, Reuven; Freund, Ari; Naor, Joseph (Seffi); Schieber, Baruch A unified approach to approximating resource allocation and scheduling. (English) Zbl 1296.68023 Proceedings of the thirty-second annual ACM symposium on theory of computing (STOC 2000), Portland, Oregon, USA, May 21–23, 2000. New York, NY: ACM Press (ISBN 1-58113-184-4). 735-744 (2000). MSC: 68M20 68W25 PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., in: Proceedings of the thirty-second annual ACM symposium on theory of computing, STOC 2000. Portland, Oregon, USA, May 21--23, 2000. New York, NY: ACM Press. 735--744 (2000; Zbl 1296.68023) Full Text: DOI
Homem-De-Mello, Tito; Shapiro, Alexander; Spearman, Mark L. Finding optimal material release times using simulation-based optimization. (English) Zbl 1231.91275 Manage. Sci. 45, No. 1, 86-102 (1999). MSC: 91B38 91B42 90B30 PDFBibTeX XMLCite \textit{T. Homem-De-Mello} et al., Manage. Sci. 45, No. 1, 86--102 (1999; Zbl 1231.91275) Full Text: DOI Link
He, Yong The multifit algorithm for set partitioning containing kernels. (English) Zbl 0951.90020 Appl. Math., Ser. B (Engl. Ed.) 14, No. 2, 227-232 (1999). MSC: 90B35 68R15 PDFBibTeX XMLCite \textit{Y. He}, Appl. Math., Ser. B (Engl. Ed.) 14, No. 2, 227--232 (1999; Zbl 0951.90020) Full Text: DOI
Bianco, Lucio; Dell’Olmo, Paolo; Giordani, Stefano Minimizing total completion time subject to release dates and sequence-dependent processing times. (English) Zbl 0921.90089 Ann. Oper. Res. 86, 393-415 (1999). MSC: 90B35 PDFBibTeX XMLCite \textit{L. Bianco} et al., Ann. Oper. Res. 86, 393--415 (1999; Zbl 0921.90089) Full Text: DOI
Tadei, R.; Gupta, J. N. D.; Della Croce, F.; Cortesi, M. Minimising makespan in the two-machine flow-shop with release times. (English) Zbl 1111.90319 J. Oper. Res. Soc. 49, No. 1, 77-85 (1998). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{R. Tadei} et al., J. Oper. Res. Soc. 49, No. 1, 77--85 (1998; Zbl 1111.90319) Full Text: DOI
Li, Chung-Lun; Lee, Chung-Yee Scheduling with agreeable release times and due dates on a batch processing machine. (English) Zbl 0929.90038 Eur. J. Oper. Res. 96, No. 3, 564-569 (1997). MSC: 90B35 90B30 90B90 PDFBibTeX XMLCite \textit{C.-L. Li} and \textit{C.-Y. Lee}, Eur. J. Oper. Res. 96, No. 3, 564--569 (1997; Zbl 0929.90038) Full Text: DOI
Chand, Suresh; Traub, Rodney; Uzsoy, Reha Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. (English) Zbl 0890.90091 Ann. Oper. Res. 70, 115-125 (1997). MSC: 90B35 PDFBibTeX XMLCite \textit{S. Chand} et al., Ann. Oper. Res. 70, 115--125 (1997; Zbl 0890.90091) Full Text: DOI
Du, Yuxiang; Du, Donglei; Zhang, Guochuan Open shop scheduling problem with release times – the worst case analysis. (Chinese. English summary) Zbl 0893.90087 Appl. Math., Ser. A (Chin. Ed.) 12, No. 2, 191-196 (1997). MSC: 90B35 PDFBibTeX XMLCite \textit{Y. Du} et al., Appl. Math., Ser. A (Chin. Ed.) 12, No. 2, 191--196 (1997; Zbl 0893.90087)
Tautenhahn, Thomas; Woeginger, Gerhard J. Minimizing the total completion time in a unit-time open shop with release times. (English) Zbl 0885.90062 Oper. Res. Lett. 20, No. 5, 207-212 (1997). MSC: 90B35 PDFBibTeX XMLCite \textit{T. Tautenhahn} and \textit{G. J. Woeginger}, Oper. Res. Lett. 20, No. 5, 207--212 (1997; Zbl 0885.90062) Full Text: DOI
Billaut, J.-C.; Roubellat, F. A new method for workshop real time scheduling. (English) Zbl 0927.90027 Int. J. Prod. Res. 34, No. 6, 1555-1579 (1996). MSC: 90B30 90B35 PDFBibTeX XMLCite \textit{J. C. Billaut} and \textit{F. Roubellat}, Int. J. Prod. Res. 34, No. 6, 1555--1579 (1996; Zbl 0927.90027) Full Text: DOI
Ivens, Philip; Lamprecht, Marc Extending the shifting bottleneck procedure to real-life applications. (English) Zbl 0916.90159 Eur. J. Oper. Res. 90, No. 2, 252-268 (1996). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Ivens} and \textit{M. Lamprecht}, Eur. J. Oper. Res. 90, No. 2, 252--268 (1996; Zbl 0916.90159) Full Text: DOI Link
Schutten, J. M. J.; van de Velde, S. L.; Zijm, W. H. M. Single-machine scheduling with release dates, due dates and family setup times. (English) Zbl 0880.90080 Manage. Sci. 42, No. 8, 1165-1174 (1996). MSC: 90B35 PDFBibTeX XMLCite \textit{J. M. J. Schutten} et al., Manage. Sci. 42, No. 8, 1165--1174 (1996; Zbl 0880.90080) Full Text: DOI Link
Balas, Egon; Lenstra, Jan Karel; Vazacopoulos, Alkis The one-machine problem with delayed precedence constraints and its use in job shop scheduling. (English) Zbl 0824.90076 Manage. Sci. 41, No. 1, 94-109 (1995). MSC: 90B35 PDFBibTeX XMLCite \textit{E. Balas} et al., Manage. Sci. 41, No. 1, 94--109 (1995; Zbl 0824.90076) Full Text: DOI
Li, Chung-Lun A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs. (English) Zbl 0827.90075 Comput. Oper. Res. 22, No. 3, 277-283 (1995). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{C.-L. Li}, Comput. Oper. Res. 22, No. 3, 277--283 (1995; Zbl 0827.90075) Full Text: DOI
Chen, Y. L. Scheduling jobs to minimize total cost. (English) Zbl 0802.90058 Eur. J. Oper. Res. 74, No. 1, 111-119 (1994). MSC: 90B35 90B10 PDFBibTeX XMLCite \textit{Y. L. Chen}, Eur. J. Oper. Res. 74, No. 1, 111--119 (1994; Zbl 0802.90058) Full Text: DOI
Nowicki, Eugeniusz An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times. (English) Zbl 0799.90065 Eur. J. Oper. Res. 72, No. 1, 74-81 (1994). MSC: 90B35 PDFBibTeX XMLCite \textit{E. Nowicki}, Eur. J. Oper. Res. 72, No. 1, 74--81 (1994; Zbl 0799.90065) Full Text: DOI
Frederickson, Greg N.; Rodger, Susan H. An NC algorithm for scheduling unit-time jobs with arbitrary release times and deadlines. (English) Zbl 0802.68016 SIAM J. Comput. 23, No. 1, 185-211 (1994). MSC: 68M20 68W15 90B35 68R05 PDFBibTeX XMLCite \textit{G. N. Frederickson} and \textit{S. H. Rodger}, SIAM J. Comput. 23, No. 1, 185--211 (1994; Zbl 0802.68016) Full Text: DOI
Sun, D.; Lin, L. A dynamic job shop scheduling framework: A backward approach. (English) Zbl 0902.90101 Int. J. Prod. Res. 32, No. 4, 967-985 (1994). MSC: 90B35 90B30 PDFBibTeX XMLCite \textit{D. Sun} and \textit{L. Lin}, Int. J. Prod. Res. 32, No. 4, 967--985 (1994; Zbl 0902.90101) Full Text: DOI
Steiner, George; Yeomans, Scott A note on “Scheduling unit-time tasks with integer release times and deadlines”. (English) Zbl 0780.68008 Inf. Process. Lett. 47, No. 3, 165-166 (1993). MSC: 68M20 68Q25 PDFBibTeX XMLCite \textit{G. Steiner} and \textit{S. Yeomans}, Inf. Process. Lett. 47, No. 3, 165--166 (1993; Zbl 0780.68008) Full Text: DOI
Özekici, Süleyman; Çatkan, Neşe A. A dynamic software release model. (English) Zbl 0774.90051 Comput. Econ. 6, No. 2, 77-94 (1993). MSC: 90B50 68N99 90B25 90C39 PDFBibTeX XMLCite \textit{S. Özekici} and \textit{N. A. Çatkan}, Comput. Econ. 6, No. 2, 77--94 (1993; Zbl 0774.90051) Full Text: DOI
Lu, Lu; Posner, Marc E. An NP-hard open shop scheduling problem with polynomial average time complexity. (English) Zbl 0779.90045 Math. Oper. Res. 18, No. 1, 12-38 (1993). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{L. Lu} and \textit{M. E. Posner}, Math. Oper. Res. 18, No. 1, 12--38 (1993; Zbl 0779.90045) Full Text: DOI
Chang, Cheng-Shang; Chao, Xiuli; Pinedo, Michael; Weber, Richard On the optimality of lept and \(c\mu\) rules for machines in parallel. (English) Zbl 0766.90038 J. Appl. Probab. 29, No. 3, 667-681 (1992). MSC: 90B35 93E03 PDFBibTeX XMLCite \textit{C.-S. Chang} et al., J. Appl. Probab. 29, No. 3, 667--681 (1992; Zbl 0766.90038) Full Text: DOI
Sousa, Jorge P.; Wolsey, Laurence A. A time indexed formulation of non-preemptive single machine scheduling problems. (English) Zbl 0768.90041 Math. Program., Ser. A 54, No. 3, 353-367 (1992). Reviewer: H.G.Kahlbacher (Wien) MSC: 90B35 90-08 90C05 PDFBibTeX XMLCite \textit{J. P. Sousa} and \textit{L. A. Wolsey}, Math. Program. 54, No. 3 (A), 353--367 (1992; Zbl 0768.90041) Full Text: DOI
Hall, Leslie A.; Shmoys, David B. Jackson’s rule for single-machine scheduling: Making a good heuristic better. (English) Zbl 0781.90052 Math. Oper. Res. 17, No. 1, 22-35 (1992). Reviewer: R.Słowinski (Poznań) MSC: 90B35 90-08 PDFBibTeX XMLCite \textit{L. A. Hall} and \textit{D. B. Shmoys}, Math. Oper. Res. 17, No. 1, 22--35 (1992; Zbl 0781.90052) Full Text: DOI Link
Tinhofer, G.; Farnbacher, E. A new lower bound for the makespan of a single machine scheduling problem. (English) Zbl 0831.90077 Kall, Peter (ed.), System modelling and optimization. Proceedings of the 15th IFIP conference, Zurich, Switzerland, September 2-6, 1991. Berlin: Springer-Verlag. Lect. Notes Control Inf. Sci. 180, 209-218 (1992). Reviewer: H.Hamacher (Kaiserslautern) MSC: 90B35 PDFBibTeX XMLCite \textit{G. Tinhofer} and \textit{E. Farnbacher}, Lect. Notes Control Inf. Sci. 180, 209--218 (1992; Zbl 0831.90077)
Nemhauser, G. L.; Savelsbergh, M. W. P. A cutting plane algorithm for the single machine scheduling problem with release times. (English) Zbl 0768.90040 Combinatorial optimization. New frontiers in theory and practice, Proc. NATO ASI, Ankara/Turkey 1990, NATO ASI Ser., Ser. F 82, 63-83 (1992). Reviewer: H.G.Kahlbacher (Wien) MSC: 90B35 90C11 90-08 PDFBibTeX XMLCite \textit{G. L. Nemhauser} and \textit{M. W. P. Savelsbergh}, in: Combinatorial optimization. New frontiers in theory and practice. Proceedings of the NATO Advanced Study Institute, held at Bilkent Univ., Ankara, Turkey, in July 16-29, 1990. Berlin etc.: Springer-Verlag. 63--83 (1992; Zbl 0768.90040)
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
Conterno, R.; Allasia, A.; Proverbio, A. A queueing network/branch-and-bound approach to lot scheduling in flexible manufacturing systems. (English) Zbl 0722.90031 Inf. Decis. Technol. 17, No. 1, 1-21 (1991). MSC: 90B30 90C90 90-08 PDFBibTeX XMLCite \textit{R. Conterno} et al., Inf. Decis. Technol. 17, No. 1, 1--21 (1991; Zbl 0722.90031)
Skomorokhov, R. V. Some features of solution of multicriterion job allocation problem. (English. Russian original) Zbl 0748.90034 Sov. Phys., Dokl. 36, No. 5, 352-354 (1991); translation from Dokl. Akad. Nauk SSSR 318, No. 1, 55-59 (1991). Reviewer: H.G.Kahlbacher (Kaiserslautern) MSC: 90B35 90-08 PDFBibTeX XMLCite \textit{R. V. Skomorokhov}, Sov. Phys., Dokl. 36, No. 5, 352--354 (1991; Zbl 0748.90034); translation from Dokl. Akad. Nauk SSSR 318, No. 1, 55--59 (1991)
Herrbach, Lee A.; Leung, Joseph Y.-T. Preemptive scheduling of equal length jobs on two machines to minimize mean flow time. (English) Zbl 0715.90064 Oper. Res. 38, No. 3, 487-494 (1990). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{L. A. Herrbach} and \textit{J. Y. T. Leung}, Oper. Res. 38, No. 3, 487--494 (1990; Zbl 0715.90064) Full Text: DOI
Hochbaum, Dorit S.; Shamir, Ron Minimizing the number of tardy job units under release time constraints. (English) Zbl 0707.90049 Discrete Appl. Math. 28, No. 1, 45-57 (1990). Reviewer: R.Slowinski MSC: 90B35 90C60 90C08 90-08 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{R. Shamir}, Discrete Appl. Math. 28, No. 1, 45--57 (1990; Zbl 0707.90049) Full Text: DOI
Plehn, Jürgen Preemptive scheduling of independent jobs with release times and deadlines on a hypercube. (English) Zbl 0695.68030 Inf. Process. Lett. 34, No. 3, 161-166 (1990). MSC: 68M20 68N99 PDFBibTeX XMLCite \textit{J. Plehn}, Inf. Process. Lett. 34, No. 3, 161--166 (1990; Zbl 0695.68030) Full Text: DOI
Dyer, Martin E.; Wolsey, Laurence A. Formulating the single machine sequencing problem with release dates as a mixed integer program. (English) Zbl 0694.90060 Discrete Appl. Math. 26, No. 2-3, 255-270 (1990). Reviewer: Y.M.Shafranskij MSC: 90B35 90C11 PDFBibTeX XMLCite \textit{M. E. Dyer} and \textit{L. A. Wolsey}, Discrete Appl. Math. 26, No. 2--3, 255--270 (1990; Zbl 0694.90060) Full Text: DOI
Adrabiński, A.; Grabowski, J.; Wodecki, M. One-machine sequencing with release dates, delivery times and precedence constraints. (English) Zbl 0752.90038 Zastosow. Mat. 20, No. 4, 483-490 (1990). Reviewer: I.N.Lushchakova (Minsk) MSC: 90B35 90-08 PDFBibTeX XMLCite \textit{A. Adrabiński} et al., Zastosow. Mat. 20, No. 4, 483--490 (1990; Zbl 0752.90038)
Gusfield, Dan; Martel, Charles; Fernandez-Baca, David Fast algorithms for bipartite network flow. (English) Zbl 0617.90082 SIAM J. Comput. 16, 237-251 (1987). Reviewer: A.Girard MSC: 90C35 68Q25 90B10 90C10 90C05 90C27 PDFBibTeX XMLCite \textit{D. Gusfield} et al., SIAM J. Comput. 16, 237--251 (1987; Zbl 0617.90082) Full Text: DOI
Posner, Marc E. A sequencing problem with release dates and clustered jobs. (English) Zbl 0597.90044 Manage. Sci. 32, 731-738 (1986). MSC: 90B35 90B30 PDFBibTeX XMLCite \textit{M. E. Posner}, Manage. Sci. 32, 731--738 (1986; Zbl 0597.90044) Full Text: DOI
Simons, Barbara; Sipser, Michael On scheduling unit-length jobs with multiple release time/deadline intervals. (English) Zbl 0531.90048 Oper. Res. 32, 80-88 (1984). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{B. Simons} and \textit{M. Sipser}, Oper. Res. 32, 80--88 (1984; Zbl 0531.90048) Full Text: DOI
Pinedo, Michael Stochastic scheduling with release dates and due dates. (English) Zbl 0523.90046 Oper. Res. 31, 559-572 (1983). MSC: 90B35 PDFBibTeX XMLCite \textit{M. Pinedo}, Oper. Res. 31, 559--572 (1983; Zbl 0523.90046) Full Text: DOI
Hariri, A. M. A.; Potts, C. N. An algorithm for single machine sequencing with release dates to minimize total weighted completion time. (English) Zbl 0498.90044 Discrete Appl. Math. 5, 99-109 (1983). MSC: 90B35 65K10 PDFBibTeX XMLCite \textit{A. M. A. Hariri} and \textit{C. N. Potts}, Discrete Appl. Math. 5, 99--109 (1983; Zbl 0498.90044) Full Text: DOI
Bertrand, J. W. M. The effect of workload control on order flow times. (English) Zbl 0473.90043 Operational research ’81, Proc. 9th IFORS int. Conf., Hamburg 1981, 779-789 (1981). MSC: 90B30 PDFBibTeX XML
Hariri, A. M. A.; Potts, C. N. An algorithm for single machine sequencing with release dates to minimise total weighted completion time. (English) Zbl 0464.90036 Math. Cent., Amst., Afd. Math. Beslisk. BW 143/81, 14 p. (1981). MSC: 90B35 90C90 PDFBibTeX XML
Cho, Yookun; Sahni, Sartaj Preemptive scheduling of independent jobs with release and due times on open, flow and job shops. (English) Zbl 0455.90043 Oper. Res. 29, 511-522 (1981). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{Y. Cho} and \textit{S. Sahni}, Oper. Res. 29, 511--522 (1981; Zbl 0455.90043) Full Text: DOI
Bruno, John; Jones, John W. III; So, Kimming Deterministic scheduling with pipelined processors. (English) Zbl 0431.68044 IEEE Trans. Comput. 29, 308-316 (1980). MSC: 68M20 68N25 PDFBibTeX XMLCite \textit{J. Bruno} et al., IEEE Trans. Comput. 29, 308--316 (1980; Zbl 0431.68044) Full Text: DOI