Azerine, Abdennour; Boudhar, Mourad; Rebaine, Djamal On the complexity of proportionate open shop and job shop problems. (English) Zbl 07792598 Optim. Lett. 18, No. 1, 365-375 (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{A. Azerine} et al., Optim. Lett. 18, No. 1, 365--375 (2024; Zbl 07792598) Full Text: DOI
Li, Shuguang; Li, Mingsong; Khan, Muhammad Ijaz Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives. (English) Zbl 07798676 Netw. Heterog. Media 18, No. 4, 1678-1691 (2023). MSC: 68M20 PDFBibTeX XMLCite \textit{S. Li} et al., Netw. Heterog. Media 18, No. 4, 1678--1691 (2023; Zbl 07798676) Full Text: DOI
Assayakh, Imad; Kacem, Imed; Lucarelli, Giorgio Min-max relative regret for scheduling to minimize maximum lateness. (English) Zbl 07781724 Hsieh, Sun-Yuan (ed.) et al., Combinatorial algorithms. 34th international workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13889, 49-61 (2023). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{I. Assayakh} et al., Lect. Notes Comput. Sci. 13889, 49--61 (2023; Zbl 07781724) Full Text: DOI
Berlińska, Joanna A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks. (English) Zbl 1523.90140 Eng. Optim. 54, No. 2, 218-231 (2022). MSC: 90B35 68M20 90B10 90C59 90C60 PDFBibTeX XMLCite \textit{J. Berlińska}, Eng. Optim. 54, No. 2, 218--231 (2022; Zbl 1523.90140) Full Text: DOI
Krivulin, Nikolai; Sergeev, Sergeĭ Minimizing maximum lateness in two-stage projects by tropical optimization. (English) Zbl 1524.90146 Kybernetika 58, No. 5, 816-841 (2022). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 90B35 90C24 15A80 90C47 90C05 PDFBibTeX XMLCite \textit{N. Krivulin} and \textit{S. Sergeev}, Kybernetika 58, No. 5, 816--841 (2022; Zbl 1524.90146) Full Text: DOI arXiv
Kordon, Alix Munier; Tang, Ning A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors. (English) Zbl 1502.90076 RAIRO, Oper. Res. 56, No. 5, 3777-3788 (2022). MSC: 90B35 68Q27 90C39 PDFBibTeX XMLCite \textit{A. M. Kordon} and \textit{N. Tang}, RAIRO, Oper. Res. 56, No. 5, 3777--3788 (2022; Zbl 1502.90076) Full Text: DOI
Rener, Elena; Salassa, Fabio; T’kindt, Vincent Single machine rescheduling for new orders with maximum lateness minimization. (English) Zbl 1520.90124 Comput. Oper. Res. 144, Article ID 105815, 8 p. (2022). MSC: 90B35 PDFBibTeX XMLCite \textit{E. Rener} et al., Comput. Oper. Res. 144, Article ID 105815, 8 p. (2022; Zbl 1520.90124) Full Text: DOI
Lazarev, Alexander A.; Lemtyuzhnikova, Darya V.; Werner, Frank A metric approach for scheduling problems with minimizing the maximum penalty. (English) Zbl 1481.90175 Appl. Math. Modelling 89, Part 2, 1163-1176 (2021). MSC: 90B35 90C47 PDFBibTeX XMLCite \textit{A. A. Lazarev} et al., Appl. Math. Modelling 89, Part 2, 1163--1176 (2021; Zbl 1481.90175) Full Text: DOI
He, Cheng; Lin, Hao Improved algorithms for two-agent scheduling on an unbounded serial-batching machine. (English) Zbl 1506.90101 Discrete Optim. 41, Article ID 100655, 7 p. (2021). MSC: 90B35 PDFBibTeX XMLCite \textit{C. He} and \textit{H. Lin}, Discrete Optim. 41, Article ID 100655, 7 p. (2021; Zbl 1506.90101) 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
He, Cheng; Xu, Chunqi; Lin, Hao Serial-batching scheduling with two agents to minimize makespan and maximum cost. (English) Zbl 1456.90071 J. Sched. 23, No. 5, 609-617 (2020). MSC: 90B35 PDFBibTeX XMLCite \textit{C. He} et al., J. Sched. 23, No. 5, 609--617 (2020; Zbl 1456.90071) Full Text: DOI
Li, Hongwei; Gajpal, Yuvraj; Bector, C. R. A survey of due-date related single-machine with two-agent scheduling problem. (English) Zbl 1449.90110 J. Ind. Manag. Optim. 16, No. 3, 1329-1347 (2020). MSC: 90B35 68M20 90-02 PDFBibTeX XMLCite \textit{H. Li} et al., J. Ind. Manag. Optim. 16, No. 3, 1329--1347 (2020; Zbl 1449.90110) Full Text: DOI
Benkalai, Imène; Rebaine, Djamal; Baptiste, Pierre Scheduling job shop problems with operators with respect to the maximum lateness. (English) Zbl 1437.90072 RAIRO, Oper. Res. 54, No. 2, 555-568 (2020). MSC: 90B35 PDFBibTeX XMLCite \textit{I. Benkalai} et al., RAIRO, Oper. Res. 54, No. 2, 555--568 (2020; Zbl 1437.90072) Full Text: DOI
Feng, Qi; Shang, Wei-Ping; Jiao, Cheng-Wen; Li, Wen-Jie Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives. (English) Zbl 1449.90137 J. Oper. Res. Soc. China 8, No. 1, 189-196 (2020). MSC: 90B36 PDFBibTeX XMLCite \textit{Q. Feng} et al., J. Oper. Res. Soc. China 8, No. 1, 189--196 (2020; Zbl 1449.90137) Full Text: DOI
Alhadi, Gais; Kacem, Imed; Laroche, Pierre; Osman, Izzeldin M. Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. (English) Zbl 1429.90022 Ann. Oper. Res. 285, No. 1-2, 369-395 (2020). MSC: 90B35 90C29 90C27 90C59 90C39 PDFBibTeX XMLCite \textit{G. Alhadi} et al., Ann. Oper. Res. 285, No. 1--2, 369--395 (2020; Zbl 1429.90022) Full Text: DOI arXiv
Emde, Simon; Polten, Lukas; Gendreau, Michel Logic-based Benders decomposition for scheduling a batching machine. (English) Zbl 1458.90288 Comput. Oper. Res. 113, Article ID 104777, 12 p. (2020). MSC: 90B35 PDFBibTeX XMLCite \textit{S. Emde} et al., Comput. Oper. Res. 113, Article ID 104777, 12 p. (2020; Zbl 1458.90288) Full Text: DOI
Wei, Wei Single machine scheduling with stochastically dependent times. (English) Zbl 1432.90067 J. Sched. 22, No. 6, 677-689 (2019). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{W. Wei}, J. Sched. 22, No. 6, 677--689 (2019; Zbl 1432.90067) Full Text: DOI
Li, Xiaolin; Li, Yupeng; Huang, Yanli Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families. (English) Zbl 1458.90325 Comput. Oper. Res. 106, 91-101 (2019). MSC: 90B35 90B30 90C59 PDFBibTeX XMLCite \textit{X. Li} et al., Comput. Oper. Res. 106, 91--101 (2019; Zbl 1458.90325) Full Text: DOI
Lin, Hao; He, Cheng A note on DP algorithm for batching scheduling to minimize maximum lateness. (English) Zbl 1424.90077 Chin. Q. J. Math. 33, No. 2, 206-211 (2018). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{H. Lin} and \textit{C. He}, Chin. Q. J. Math. 33, No. 2, 206--211 (2018; Zbl 1424.90077) Full Text: DOI
Allahverdi, Ali; Allahverdi, Muberra Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness. (English) Zbl 1413.90104 Comput. Appl. Math. 37, No. 5, 6774-6794 (2018). MSC: 90B36 PDFBibTeX XMLCite \textit{A. Allahverdi} and \textit{M. Allahverdi}, Comput. Appl. Math. 37, No. 5, 6774--6794 (2018; Zbl 1413.90104) Full Text: DOI
Hinder, Oliver; Mason, Andrew J. A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness. (English) Zbl 1375.90126 Eur. J. Oper. Res. 262, No. 2, 411-423 (2017). MSC: 90B35 90C10 PDFBibTeX XMLCite \textit{O. Hinder} and \textit{A. J. Mason}, Eur. J. Oper. Res. 262, No. 2, 411--423 (2017; Zbl 1375.90126) Full Text: DOI
Zhao, Qiulan; Yuan, Jinjiang Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs. (English) Zbl 1379.90008 Asia-Pac. J. Oper. Res. 34, No. 5, Article ID 1750024, 12 p. (2017). MSC: 90B35 PDFBibTeX XMLCite \textit{Q. Zhao} and \textit{J. Yuan}, Asia-Pac. J. Oper. Res. 34, No. 5, Article ID 1750024, 12 p. (2017; Zbl 1379.90008) Full Text: DOI
Zhao, Qiulan; Lu, Lingfa; Yuan, Jinjiang Rescheduling with new orders and general maximum allowable time disruptions. (English) Zbl 1348.90338 4OR 14, No. 3, 261-280 (2016). MSC: 90B35 PDFBibTeX XMLCite \textit{Q. Zhao} et al., 4OR 14, No. 3, 261--280 (2016; Zbl 1348.90338) Full Text: DOI
Kacem, Imed; Kellerer, Hans; Seifaddini, Maryam Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. (English) Zbl 1353.90063 J. Comb. Optim. 32, No. 3, 970-981 (2016). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{I. Kacem} et al., J. Comb. Optim. 32, No. 3, 970--981 (2016; Zbl 1353.90063) Full Text: DOI
He, Cheng; Lin, Hao Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness. (English) Zbl 1338.90165 4OR 14, No. 2, 153-164 (2016). MSC: 90B35 PDFBibTeX XMLCite \textit{C. He} and \textit{H. Lin}, 4OR 14, No. 2, 153--164 (2016; Zbl 1338.90165) Full Text: DOI
Bampis, Evripidis; Letsios, Dimitrios; Milis, Ioannis; Zois, Georgios Speed scaling for maximum lateness. (English) Zbl 1336.68019 Theory Comput. Syst. 58, No. 2, 304-321 (2016). MSC: 68M20 68Q17 90B35 PDFBibTeX XMLCite \textit{E. Bampis} et al., Theory Comput. Syst. 58, No. 2, 304--321 (2016; Zbl 1336.68019) Full Text: DOI
He, Cheng; Lin, Hao; Lin, Yixun Bounded serial-batching scheduling for minimizing maximum lateness and makespan. (English) Zbl 1387.90090 Discrete Optim. 16, 70-75 (2015). MSC: 90B35 90C29 90C39 PDFBibTeX XMLCite \textit{C. He} et al., Discrete Optim. 16, 70--75 (2015; Zbl 1387.90090) Full Text: DOI
Cabo, Marta; Possani, Edgar; Potts, Chris N.; Song, Xiang Split-merge: using exponential neighborhood search for scheduling a batching machine. (English) Zbl 1349.90322 Comput. Oper. Res. 63, 125-135 (2015). MSC: 90B35 90C39 90C59 PDFBibTeX XMLCite \textit{M. Cabo} et al., Comput. Oper. Res. 63, 125--135 (2015; Zbl 1349.90322) Full Text: DOI
Zinder, Y.; Walker, S. Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness. (English) Zbl 1330.90041 Discrete Appl. Math. 196, 28-53 (2015). MSC: 90B35 PDFBibTeX XMLCite \textit{Y. Zinder} and \textit{S. Walker}, Discrete Appl. Math. 196, 28--53 (2015; Zbl 1330.90041) Full Text: DOI
Gawiejnowicz, Stanisław; Suwalski, Cezary Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria. (English) Zbl 1348.90261 Comput. Oper. Res. 52, Part A, 135-146 (2014). MSC: 90B35 90C59 90C60 PDFBibTeX XMLCite \textit{S. Gawiejnowicz} and \textit{C. Suwalski}, Comput. Oper. Res. 52, Part A, 135--146 (2014; Zbl 1348.90261) Full Text: DOI
Kacem, Imed; Kellerer, Hans Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. (English) Zbl 1335.90037 Discrete Appl. Math. 164, Part 1, 154-160 (2014). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{I. Kacem} and \textit{H. Kellerer}, Discrete Appl. Math. 164, Part 1, 154--160 (2014; Zbl 1335.90037) Full Text: DOI
Liu, Le; Zhou, Hong Single-machine rescheduling of minimizing the maximum lateness with the disruptive arrival of new jobs. (Chinese. English summary) Zbl 1324.90074 J. Syst. Eng. 29, No. 4, 494-506 (2014). MSC: 90B36 90C59 90C57 PDFBibTeX XMLCite \textit{L. Liu} and \textit{H. Zhou}, J. Syst. Eng. 29, No. 4, 494--506 (2014; Zbl 1324.90074)
Feng, Qi; Yuan, Jinjiang; Liu, Hailing; He, Cheng A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives. (English) Zbl 1426.90120 Appl. Math. Modelling 37, No. 10-11, 7071-7076 (2013). MSC: 90B35 PDFBibTeX XMLCite \textit{Q. Feng} et al., Appl. Math. Modelling 37, No. 10--11, 7071--7076 (2013; Zbl 1426.90120) Full Text: DOI
Cheng, T. C. E.; Chung, Yu-Hsiang; Liao, Shan-Ci; Lee, Wen-Chiung Two-agent singe-machine scheduling with release times to minimize the total weighted completion time. (English) Zbl 1349.90329 Comput. Oper. Res. 40, No. 1, 353-361 (2013). MSC: 90B35 90C29 PDFBibTeX XMLCite \textit{T. C. E. Cheng} et al., Comput. Oper. Res. 40, No. 1, 353--361 (2013; Zbl 1349.90329) Full Text: DOI
Lobo, Benjamin J.; Hodgson, Thom J.; King, Russell E.; Thoney, Kristin A.; Wilson, James R. An effective lower bound on \(L_{\max}\) in a worker-constrained job shop. (English) Zbl 1349.90378 Comput. Oper. Res. 40, No. 1, 328-343 (2013). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{B. J. Lobo} et al., Comput. Oper. Res. 40, No. 1, 328--343 (2013; Zbl 1349.90378) Full Text: DOI
Lobo, Benjamin J.; Hodgson, Thom J.; King, Russell E.; Thoney, Kristin A.; Wilson, James R. Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics. (English) Zbl 1348.90289 Comput. Oper. Res. 40, No. 10, 2569-2584 (2013). MSC: 90B35 90B70 90C59 PDFBibTeX XMLCite \textit{B. J. Lobo} et al., Comput. Oper. Res. 40, No. 10, 2569--2584 (2013; Zbl 1348.90289) Full Text: DOI
He, Cheng; Lin, Hao; Lin, Yixun; Tian, Ji Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan. (English) Zbl 1339.90139 CEJOR, Cent. Eur. J. Oper. Res. 21, No. 1, 177-186 (2013). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{C. He} et al., CEJOR, Cent. Eur. J. Oper. Res. 21, No. 1, 177--186 (2013; Zbl 1339.90139) Full Text: DOI
Li, S. S.; Brucker, P.; Ng, C. T.; Cheng, T. C. E.; Shakhlevich, N. V.; Yuan, J. J. A note on reverse scheduling with maximum lateness objective. (English) Zbl 1297.90053 J. Sched. 16, No. 4, 417-422 (2013). MSC: 90B35 PDFBibTeX XMLCite \textit{S. S. Li} et al., J. Sched. 16, No. 4, 417--422 (2013; Zbl 1297.90053) Full Text: DOI Link
Leung, Joseph Y.-T.; Chen, Zhi-Long Integrated production and distribution with fixed delivery departure dates. (English) Zbl 1286.90048 Oper. Res. Lett. 41, No. 3, 290-293 (2013). MSC: 90B30 PDFBibTeX XMLCite \textit{J. Y. T. Leung} and \textit{Z.-L. Chen}, Oper. Res. Lett. 41, No. 3, 290--293 (2013; Zbl 1286.90048) Full Text: DOI
Zhang, Zhe; Li, Wenhua Algorithms for two kinds of parallel batch scheduling with batching costs. (Chinese. English summary) Zbl 1299.90179 Chin. J. Eng. Math. 30, No. 4, 629-632 (2013). MSC: 90B35 90C27 PDFBibTeX XMLCite \textit{Z. Zhang} and \textit{W. Li}, Chin. J. Eng. Math. 30, No. 4, 629--632 (2013; Zbl 1299.90179) Full Text: DOI
Su, Ling-Huey; Chen, Ping-Shun; Chen, Szu-Yin Scheduling on parallel machines to minimise maximum lateness for the customer order problem. (English) Zbl 1282.90081 Int. J. Syst. Sci. 44, No. 5, 926-936 (2013). MSC: 90B36 PDFBibTeX XMLCite \textit{L.-H. Su} et al., Int. J. Syst. Sci. 44, No. 5, 926--936 (2013; Zbl 1282.90081) Full Text: DOI
Walker, Sam; Zinder, Yakov The solvable cases of a scheduling algorithm. (English) Zbl 1407.90177 Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8283, 229-239 (2013). MSC: 90B35 PDFBibTeX XMLCite \textit{S. Walker} and \textit{Y. Zinder}, Lect. Notes Comput. Sci. 8283, 229--239 (2013; Zbl 1407.90177) Full Text: DOI
Vakhania, Nodari; Werner, Frank Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time. (English) Zbl 1297.90060 Theor. Comput. Sci. 501, 72-81 (2013). MSC: 90B35 PDFBibTeX XMLCite \textit{N. Vakhania} and \textit{F. Werner}, Theor. Comput. Sci. 501, 72--81 (2013; Zbl 1297.90060) Full Text: DOI
Zinder, Yakov; Memar, Julia; Singh, Gaurav Discrete optimization with polynomially detectable boundaries and restricted level sets. (English) Zbl 1268.90034 J. Comb. Optim. 25, No. 2, 308-325 (2013). MSC: 90C10 90B35 PDFBibTeX XMLCite \textit{Y. Zinder} et al., J. Comb. Optim. 25, No. 2, 308--325 (2013; Zbl 1268.90034) Full Text: DOI
Yedidsion, Liron Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine. (English) Zbl 1280.90075 J. Sched. 15, No. 6, 665-679 (2012). MSC: 90B35 90C29 PDFBibTeX XMLCite \textit{L. Yedidsion}, J. Sched. 15, No. 6, 665--679 (2012; Zbl 1280.90075) Full Text: DOI
Chen, Jun; Wu, Cuilian An approximation algorithm for \(1\mid B,r_j,s_j\mid L_{\max}\). (Chinese. English summary) Zbl 1265.90107 J. Qufu Norm. Univ., Nat. Sci. 38, No. 2, 54-57 (2012). MSC: 90B35 90C59 68W25 PDFBibTeX XMLCite \textit{J. Chen} and \textit{C. Wu}, J. Qufu Norm. Univ., Nat. Sci. 38, No. 2, 54--57 (2012; Zbl 1265.90107)
Miao, Cuixia; Zhang, Yuzhong; Wu, Cuilian Scheduling of deteriorating jobs with release dates to minimize the maximum lateness. (English) Zbl 1252.90027 Theor. Comput. Sci. 462, 80-87 (2012). MSC: 90B35 68Q17 68W25 PDFBibTeX XMLCite \textit{C. Miao} et al., Theor. Comput. Sci. 462, 80--87 (2012; Zbl 1252.90027) Full Text: DOI
Jiang, Zhongyi; Chen, Fangfang; Wu, Chunqing Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect. (English) Zbl 1245.90033 Appl. Math. Comput. 218, No. 18, 9438-9441 (2012). MSC: 90B35 PDFBibTeX XMLCite \textit{Z. Jiang} et al., Appl. Math. Comput. 218, No. 18, 9438--9441 (2012; Zbl 1245.90033) Full Text: DOI
Zhang, Rui; Wu, Cheng An artificial bee colony algorithm for the job shop scheduling problem with random processing times. (English) Zbl 1305.90218 Entropy 13, No. 9, 1708-1729 (2011). MSC: 90B36 PDFBibTeX XMLCite \textit{R. Zhang} and \textit{C. Wu}, Entropy 13, No. 9, 1708--1729 (2011; Zbl 1305.90218) Full Text: DOI
Li, Kai; Yang, Shan-Lin; Ma, Hua-Wei A simulated annealing approach to minimize the maximum lateness on uniform parallel machines. (English) Zbl 1217.90004 Math. Comput. Modelling 53, No. 5-6, 854-860 (2011). MSC: 90-04 90C59 90B35 PDFBibTeX XMLCite \textit{K. Li} et al., Math. Comput. Modelling 53, No. 5--6, 854--860 (2011; Zbl 1217.90004) Full Text: DOI
Lin, Shih-Wei; Lee, Zne-Jung; Ying, Kuo-Ching; Lu, Chung-Cheng Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates. (English) Zbl 1202.90138 Comput. Oper. Res. 38, No. 5, 809-815 (2011). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{S.-W. Lin} et al., Comput. Oper. Res. 38, No. 5, 809--815 (2011; Zbl 1202.90138) Full Text: DOI
Benabid, Abir; Hanen, Claire Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors. (English) Zbl 1237.90141 Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 791-798 (2010). MSC: 90B90 90B35 05C85 PDFBibTeX XMLCite \textit{A. Benabid} and \textit{C. Hanen}, Electron. Notes Discrete Math. 36, 791--798 (2010; Zbl 1237.90141) Full Text: DOI
Benabid, A.; Hanen, C. Performance of Garey-Johnson algorithm for pipelined typed tasks systems. (English) Zbl 1213.68140 Int. Trans. Oper. Res. 17, No. 6, 797-808 (2010). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{A. Benabid} and \textit{C. Hanen}, Int. Trans. Oper. Res. 17, No. 6, 797--808 (2010; Zbl 1213.68140) 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
Della Croce, F.; T’kindt, V. Improving the preemptive bound for the single machine dynamic maximum lateness problem. (English) Zbl 1202.90131 Oper. Res. Lett. 38, No. 6, 589-591 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{F. Della Croce} and \textit{V. T'kindt}, Oper. Res. Lett. 38, No. 6, 589--591 (2010; Zbl 1202.90131) Full Text: DOI
Allahverdi, Ali; Aydilek, Harun Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times. (English) Zbl 1201.90070 Comput. Math. Appl. 60, No. 5, 1374-1384 (2010). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{A. Allahverdi} and \textit{H. Aydilek}, Comput. Math. Appl. 60, No. 5, 1374--1384 (2010; Zbl 1201.90070) Full Text: DOI
Xu, Dehua; Yin, Yunqiang; Li, Hongxing Comments on “A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect”. (English) Zbl 1197.90238 Appl. Math. Comput. 217, No. 2, 939-943 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{D. Xu} et al., Appl. Math. Comput. 217, No. 2, 939--943 (2010; Zbl 1197.90238) Full Text: DOI
Jin, F.; Gupta, J. N. D.; Song, S.; Wu, C. Single machine scheduling with sequence-dependent family setups to minimize maximum lateness. (English) Zbl 1193.90101 J. Oper. Res. Soc. 61, No. 7, 1181-1189 (2010). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{F. Jin} et al., J. Oper. Res. Soc. 61, No. 7, 1181--1189 (2010; Zbl 1193.90101) Full Text: DOI
Wang, Chuyang; Li, Xiaoping; Wang, Qian Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion. (English) Zbl 1188.90115 Eur. J. Oper. Res. 206, No. 1, 64-72 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{C. Wang} et al., Eur. J. Oper. Res. 206, No. 1, 64--72 (2010; Zbl 1188.90115) Full Text: DOI
Wan, Guohua; Vakati, Sudheer R.; Leung, Joseph Y.-T.; Pinedo, Michael Scheduling two agents with controllable processing times. (English) Zbl 1188.90114 Eur. J. Oper. Res. 205, No. 3, 528-539 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{G. Wan} et al., Eur. J. Oper. Res. 205, No. 3, 528--539 (2010; Zbl 1188.90114) Full Text: DOI
Wang, Ji-Bo; Wang, Dan; Zhang, Guo-Dong Single-machine scheduling with learning functions. (English) Zbl 1187.90145 Appl. Math. Comput. 216, No. 4, 1280-1286 (2010). MSC: 90B35 68T05 PDFBibTeX XMLCite \textit{J.-B. Wang} et al., Appl. Math. Comput. 216, No. 4, 1280--1286 (2010; Zbl 1187.90145) Full Text: DOI
Zhang, Xingong; Yan, Guangle Single-machine group scheduling problems with deteriorated and learning effect. (English) Zbl 1187.90147 Appl. Math. Comput. 216, No. 4, 1259-1266 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{X. Zhang} and \textit{G. Yan}, Appl. Math. Comput. 216, No. 4, 1259--1266 (2010; Zbl 1187.90147) Full Text: DOI
Sabouni, M. T. Yazdani; Jolai, F. Optimal methods for batch processing problem with makespan and maximum lateness objectives. (English) Zbl 1185.90092 Appl. Math. Modelling 34, No. 2, 314-324 (2010). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{M. T. Y. Sabouni} and \textit{F. Jolai}, Appl. Math. Modelling 34, No. 2, 314--324 (2010; Zbl 1185.90092) Full Text: DOI
Liu, Zhixin Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints. (English) Zbl 1187.90136 Comput. Oper. Res. 37, No. 9, 1537-1543 (2010). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{Z. Liu}, Comput. Oper. Res. 37, No. 9, 1537--1543 (2010; Zbl 1187.90136) Full Text: DOI
Hanen, Claire; Zinder, Yakov The worst-case analysis of the Garey-Johnson algorithm. (English) Zbl 1185.90111 J. Sched. 12, No. 4, 389-400 (2009). MSC: 90B36 PDFBibTeX XMLCite \textit{C. Hanen} and \textit{Y. Zinder}, J. Sched. 12, No. 4, 389--400 (2009; Zbl 1185.90111) Full Text: DOI
He, Cheng; Lin, Yixun; Fu, Ruyan Bicriteria scheduling with double due dates to minimize the maximum lateness. (English) Zbl 1183.90171 Chin. J. Eng. Math. 26, No. 1, 147-150 (2009). MSC: 90B35 90C29 PDFBibTeX XMLCite \textit{C. He} et al., Chin. J. Eng. Math. 26, No. 1, 147--150 (2009; Zbl 1183.90171)
Brucker, Peter; Shakhlevich, Natalia V. Inverse scheduling with maximum lateness objective. (English) Zbl 1176.90195 J. Sched. 12, No. 5, 475-488 (2009). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{N. V. Shakhlevich}, J. Sched. 12, No. 5, 475--488 (2009; Zbl 1176.90195) Full Text: DOI Link
Al-Anzi, Fawaz S.; Allahverdi, Ali Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan. (English) Zbl 1179.90117 Comput. Oper. Res. 36, No. 9, 2682-2689 (2009). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{F. S. Al-Anzi} and \textit{A. Allahverdi}, Comput. Oper. Res. 36, No. 9, 2682--2689 (2009; Zbl 1179.90117) Full Text: DOI
Eren, Tamer A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect. (English) Zbl 1156.90360 Appl. Math. Comput. 209, No. 2, 186-190 (2009). MSC: 90B35 68T05 PDFBibTeX XMLCite \textit{T. Eren}, Appl. Math. Comput. 209, No. 2, 186--190 (2009; Zbl 1156.90360) Full Text: DOI
Wang, Jibo; Ma, Li; Wang, Liyan; Wang, Dan; Yin, Na Two single machine scheduling problems with a learning effect. (English) Zbl 1183.90195 J. Dalian Univ. Technol. 48, No. 6, 932-936 (2008). MSC: 90B35 PDFBibTeX XMLCite \textit{J. Wang} et al., J. Dalian Univ. Technol. 48, No. 6, 932--936 (2008; Zbl 1183.90195)
Wang, Ji-Bo Single-machine scheduling with general learning functions. (English) Zbl 1165.90470 Comput. Math. Appl. 56, No. 8, 1941-1947 (2008). MSC: 90B35 PDFBibTeX XMLCite \textit{J.-B. Wang}, Comput. Math. Appl. 56, No. 8, 1941--1947 (2008; Zbl 1165.90470) Full Text: DOI
Wu, Xianyi; Zhou, Xian Stochastic scheduling to minimize expected maximum lateness. (English) Zbl 1146.90431 Eur. J. Oper. Res. 190, No. 1, 103-115 (2008). MSC: 90B36 90C39 PDFBibTeX XMLCite \textit{X. Wu} and \textit{X. Zhou}, Eur. J. Oper. Res. 190, No. 1, 103--115 (2008; Zbl 1146.90431) Full Text: DOI
Uthaisombut, Patchrawat Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness. (English) Zbl 1141.68023 Algorithmica 50, No. 3, 312-328 (2008). MSC: 68M20 PDFBibTeX XMLCite \textit{P. Uthaisombut}, Algorithmica 50, No. 3, 312--328 (2008; Zbl 1141.68023) Full Text: DOI
Cai, Xiaoqiang; Wang, Liming; Zhou, Xian Single-machine scheduling to stochastically minimize maximum lateness. (English) Zbl 1168.90487 J. Sched. 10, No. 4-5, 293-301 (2007). MSC: 90B36 PDFBibTeX XMLCite \textit{X. Cai} et al., J. Sched. 10, No. 4--5, 293--301 (2007; Zbl 1168.90487) Full Text: DOI
Kuo, Wen-Hung; Yang, Dar-Li Single-machine scheduling problems with the time-dependent learning effect. (English) Zbl 1152.90451 Comput. Math. Appl. 53, No. 11, 1733-1739 (2007). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{W.-H. Kuo} and \textit{D.-L. Yang}, Comput. Math. Appl. 53, No. 11, 1733--1739 (2007; Zbl 1152.90451) Full Text: DOI
Lazarev, A. A. Estimation of absolute error in scheduling problems of minimizing the maximum lateness. (English. Russian original) Zbl 1162.90012 Dokl. Math. 76, No. 1, 572-574 (2007); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 415, No. 4, 446-449 (2007). Reviewer: Vitaly A. Strusevich (London) MSC: 90B35 90B30 90C59 PDFBibTeX XMLCite \textit{A. A. Lazarev}, Dokl. Math. 76, No. 1, 572--574 (2007; Zbl 1162.90012); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 415, No. 4, 446--449 (2007) Full Text: DOI
Zhao, Chuanli; Tang, Hengyong Single machine scheduling problem with nonlinear processing times. (Chinese. English summary) Zbl 1164.60449 Math. Pract. Theory 37, No. 16, 90-95 (2007). MSC: 60K25 90B22 PDFBibTeX XMLCite \textit{C. Zhao} and \textit{H. Tang}, Math. Pract. Theory 37, No. 16, 90--95 (2007; Zbl 1164.60449)
Singh, Gaurav Performance of critical path type algorithms with communication delay. (English) Zbl 1145.90395 Int. J. Oper. Res., Taichung 4, No. 2, 90-97 (2007). MSC: 90B35 PDFBibTeX XMLCite \textit{G. Singh}, Int. J. Oper. Res., Taichung 4, No. 2, 90--97 (2007; Zbl 1145.90395)
Li, Wenhua A kind of single machine parallel batch scheduling problems with three hierarchical criteria. (Chinese. English summary) Zbl 1174.90476 Chin. J. Eng. Math. 24, No. 1, 183-186 (2007). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{W. Li}, Chin. J. Eng. Math. 24, No. 1, 183--186 (2007; Zbl 1174.90476)
He, Cheng; Lin, Yixun; Yuan, Jinjiang Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. (English) Zbl 1206.90043 Theor. Comput. Sci. 381, No. 1-3, 234-240 (2007). Reviewer: I. N. Lushchakova (Minsk) MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{C. He} et al., Theor. Comput. Sci. 381, No. 1--3, 234--240 (2007; Zbl 1206.90043) Full Text: DOI
Sourirajan, Karthik; Uzsoy, Reha Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication. (English) Zbl 1154.90491 J. Sched. 10, No. 1, 41-65 (2007). MSC: 90B35 PDFBibTeX XMLCite \textit{K. Sourirajan} and \textit{R. Uzsoy}, J. Sched. 10, No. 1, 41--65 (2007; Zbl 1154.90491) Full Text: DOI
Al-Anzi, Fawaz S.; Allahverdi, Ali A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. (English) Zbl 1128.90024 Eur. J. Oper. Res. 182, No. 1, 80-94 (2007). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{F. S. Al-Anzi} and \textit{A. Allahverdi}, Eur. J. Oper. Res. 182, No. 1, 80--94 (2007; Zbl 1128.90024) Full Text: DOI
Lu, L. F.; Yuan, J. J. The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard. (English) Zbl 1109.90043 Eur. J. Oper. Res. 177, No. 2, 1302-1309 (2007). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{L. F. Lu} and \textit{J. J. Yuan}, Eur. J. Oper. Res. 177, No. 2, 1302--1309 (2007; Zbl 1109.90043) Full Text: DOI
van den Akker, J. M.; Hoogeveen, J. A.; van Kempen, J. W. Parallel machine scheduling through column generation: Minimax objective functions. (English) Zbl 1131.90366 Azar, Yossi (ed.) et al., Algorithms – ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11–13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 648-659 (2006). MSC: 90B35 PDFBibTeX XMLCite \textit{J. M. van den Akker} et al., Lect. Notes Comput. Sci. 4168, 648--659 (2006; Zbl 1131.90366) Full Text: DOI
Al-Anzi, F. S.; Allahverdi, A. Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm. (English) Zbl 1114.90372 Int. J. Prod. Res. 44, No. 22, 4701-4712 (2006). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{F. S. Al-Anzi} and \textit{A. Allahverdi}, Int. J. Prod. Res. 44, No. 22, 4701--4712 (2006; Zbl 1114.90372) Full Text: DOI
Wang, Xiuli; Cheng, T. C. E. A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups. (English) Zbl 1104.90024 Comput. Oper. Res. 33, No. 5, 1326-1344 (2006). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{X. Wang} and \textit{T. C. E. Cheng}, Comput. Oper. Res. 33, No. 5, 1326--1344 (2006; Zbl 1104.90024) Full Text: DOI
Allahverdi, Ali; Al-Anzi, Fawaz S. A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. (English) Zbl 1079.90045 Comput. Oper. Res. 33, No. 4, 1056-1080 (2006). MSC: 90B35 90B40 90C59 PDFBibTeX XMLCite \textit{A. Allahverdi} and \textit{F. S. Al-Anzi}, Comput. Oper. Res. 33, No. 4, 1056--1080 (2006; Zbl 1079.90045) Full Text: DOI
Zinder, Yakov; Singh, Gaurav Preemptive scheduling on parallel processors with due dates. (English) Zbl 1080.90047 Asia-Pac. J. Oper. Res. 22, No. 4, 445-462 (2005). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{Y. Zinder} and \textit{G. Singh}, Asia-Pac. J. Oper. Res. 22, No. 4, 445--462 (2005; Zbl 1080.90047) Full Text: DOI
Singh, Gaurav Scheduling UET-UCT outforests to minimize maximum lateness. (English) Zbl 1066.90040 Eur. J. Oper. Res. 165, No. 2, 468-478 (2005). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{G. Singh}, Eur. J. Oper. Res. 165, No. 2, 468--478 (2005; Zbl 1066.90040) Full Text: DOI
Leung, Joseph Y.-T.; Pinedo, Michael A note on scheduling parallel machines subject to breakdown and repair. (English) Zbl 1055.90035 Nav. Res. Logist. 51, No. 1, 60-71 (2004). MSC: 90B35 68M20 90B25 PDFBibTeX XMLCite \textit{J. Y. T. Leung} and \textit{M. Pinedo}, Nav. Res. Logist. 51, No. 1, 60--71 (2004; Zbl 1055.90035) Full Text: DOI
Allahverdi, Ali; Aldowaisan, Tariq No-wait flowshops with bicriteria of makespan and maximum lateness. (English) Zbl 1044.90040 Eur. J. Oper. Res. 152, No. 1, 132-147 (2004). MSC: 90B50 90C59 PDFBibTeX XMLCite \textit{A. Allahverdi} and \textit{T. Aldowaisan}, Eur. J. Oper. Res. 152, No. 1, 132--147 (2004; Zbl 1044.90040) Full Text: DOI
Leung, Joseph Y.-T.; Pinedo, Michael Minimizing total completion time on parallel machines with deadline constraints. (English) Zbl 1052.90034 SIAM J. Comput. 32, No. 5, 1370-1388 (2003). MSC: 90B35 68M20 90C60 PDFBibTeX XMLCite \textit{J. Y. T. Leung} and \textit{M. Pinedo}, SIAM J. Comput. 32, No. 5, 1370--1388 (2003; Zbl 1052.90034) Full Text: DOI
Zinder, Yakov An iterative algorithm for scheduling UET tasks with due dates and release times. (English) Zbl 1059.90078 Eur. J. Oper. Res. 149, No. 2, 404-416 (2003). Reviewer: Jacek Błazewicz (Poznań) MSC: 90B35 PDFBibTeX XMLCite \textit{Y. Zinder}, Eur. J. Oper. Res. 149, No. 2, 404--416 (2003; Zbl 1059.90078) Full Text: DOI
Haouari, Mohamed; Gharbi, Anis An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines. (English) Zbl 1013.90066 Oper. Res. Lett. 31, No. 1, 49-52 (2003). MSC: 90B35 PDFBibTeX XMLCite \textit{M. Haouari} and \textit{A. Gharbi}, Oper. Res. Lett. 31, No. 1, 49--52 (2003; Zbl 1013.90066) Full Text: DOI
Gerodimos, A. E.; Glass, C. A.; Potts, C. N.; Tautenhahn, T. Scheduling multi-operation jobs on a single machine. (English) Zbl 0931.90014 Ann. Oper. Res. 92, 87-105 (1999). MSC: 90B35 90C39 68Q25 90C60 PDFBibTeX XMLCite \textit{A. E. Gerodimos} et al., Ann. Oper. Res. 92, 87--105 (1999; Zbl 0931.90014) Full Text: DOI
Tanaka, Keisuke; Vlach, Milan Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine. (English) Zbl 0922.90092 Ann. Oper. Res. 86, 507-526 (1999). MSC: 90B35 PDFBibTeX XMLCite \textit{K. Tanaka} and \textit{M. Vlach}, Ann. Oper. Res. 86, 507--526 (1999; Zbl 0922.90092) Full Text: DOI
Allahverdi, A.; Aldowaisan, T. Job lateness in flowshops with setup and removal times separated. (English) Zbl 1140.90386 J. Oper. Res. Soc. 49, No. 9, 1001-1006 (1998). MSC: 90B35 PDFBibTeX XMLCite \textit{A. Allahverdi} and \textit{T. Aldowaisan}, J. Oper. Res. Soc. 49, No. 9, 1001--1006 (1998; Zbl 1140.90386) Full Text: DOI
Hodgson, Thom J.; Cormier, Denis; Weintraub, Alexander J.; Zozom, Andrew jun. Satisfying due dates in large job shops. (English) Zbl 0989.90064 Manage. Sci. 44, No. 10, 1442-1446 (1998). MSC: 90B35 PDFBibTeX XMLCite \textit{T. J. Hodgson} et al., Manage. Sci. 44, No. 10, 1442--1446 (1998; Zbl 0989.90064) Full Text: DOI
Zinder, Yakov; Roper, Duncan An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness. (English) Zbl 0908.90178 Ann. Oper. Res. 81, 321-340 (1998). MSC: 90B35 PDFBibTeX XMLCite \textit{Y. Zinder} and \textit{D. Roper}, Ann. Oper. Res. 81, 321--340 (1998; Zbl 0908.90178) Full Text: DOI
Timkosvky, Vadim G. Is a unit-job shop not easier than identical parallel machines? (English) Zbl 0908.90173 Discrete Appl. Math. 85, No. 2, 149-162 (1998). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{V. G. Timkosvky}, Discrete Appl. Math. 85, No. 2, 149--162 (1998; Zbl 0908.90173) Full Text: DOI Link