{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:54:23Z","timestamp":1760144063388,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T00:00:00Z","timestamp":1710806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>High-throughput screening systems are robotic cells that automatically scan and analyze thousands of biochemical samples and reagents in real time. The problem under consideration is to find an optimal cyclic schedule of robot moves that ensures maximum cell performance. To address this issue, we proposed a new efficient version of the parametric PERT\/CPM project management method that works in conjunction with a combinatorial subalgorithm capable of rejecting unfeasible schedules. The main result obtained is that the new fast PERT\/CPM method finds optimal robust schedules for solving large size problems in strongly polynomial time, which cannot be achieved using existing algorithms.<\/jats:p>","DOI":"10.3390\/a17030127","type":"journal-article","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T04:36:31Z","timestamp":1710822991000},"page":"127","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Algorithm for High-Throughput Screening Scheduling Based on the PERT\/CPM Project Management Technique"],"prefix":"10.3390","volume":"17","author":[{"given":"Eugene","family":"Levner","sequence":"first","affiliation":[{"name":"School of Computer Science, Holon Institute of Technology, Holon 5810201, Israel"}]},{"given":"Vladimir","family":"Kats","sequence":"additional","affiliation":[{"name":"Institute for Industrial Mathematics, Beer-Sheva 8424902, Israel"}]},{"given":"Pengyu","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Economic and Management, University of Electronic Science and Technology of China, Chengdu 610054, China"}]},{"given":"Ada","family":"Che","sequence":"additional","affiliation":[{"name":"School of Management, Northwestern Polytechnic University, Xi\u2019an 710072, China"}]}],"member":"1968","published-online":{"date-parts":[[2024,3,19]]},"reference":[{"key":"ref_1","unstructured":"Aramaki, M., Enjohji, K., Yoshimura, M., Sakawa, M., and Kato, K. (2001). Knowledge-Based Intelligent Information Engineering Systems & Allied Technologies, KES 2001, ISO Press."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1016\/j.drudis.2020.07.024","article-title":"High-throughput screening: Today\u2019s biochemical and cell-based approaches","volume":"25","author":"Blay","year":"2020","journal-title":"Drug Discov. Today"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.conengprac.2010.12.006","article-title":"Modeling and control of high throughput screening systems","volume":"20","author":"Brunsch","year":"2012","journal-title":"Control Eng. Pract."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/(SICI)1098-2728(1996)8:5<295::AID-LRA6>3.0.CO;2-W","article-title":"Scheduling software for high-throughput screening","volume":"8","author":"Murray","year":"1996","journal-title":"Lab. Robot. Autom."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Pinedo, M.L. (2012). Scheduling, Springer.","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Werner, F. (2023). Scheduling: Algorithms and Applications. Algorithms, 16.","DOI":"10.3390\/books978-3-0365-8277-1"},{"key":"ref_7","unstructured":"Werner, F., Burtseva, L., and Sotskov, Y. (2020). Exact and Heuristic Scheduling, MDPI-Multidisciplinary Digital Publishing Institute."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.drudis.2006.02.001","article-title":"Critical review of the role of HTS in drug discovery","volume":"11","author":"Macarron","year":"2006","journal-title":"Drug Discov. Today"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/s12033-010-9335-9","article-title":"Design and implementation of high throughput screening assays","volume":"47","author":"Hertzberg","year":"2011","journal-title":"Mol. Biotechnol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1177\/108705719800300102","article-title":"Challenges and opportunities in high throughput screening: Implications for new technologies","volume":"3","author":"Major","year":"1998","journal-title":"J. Biomol. Screen."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.2174\/1386207324666210811124856","article-title":"High throughput screening for drug discovery and virus detection","volume":"25","author":"Oke","year":"2022","journal-title":"Comb. Chem. High Throughput Screen."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Wu, N.Q., Qiao, Y., and Li, Z.W. (2022, January 20\u201324). Efficient approach to scheduling of high throughput screening systems: A case study. Proceedings of the IEEE 18th International Conference on Automation Science and Engineering (CASE), Mexico City, Mexico.","DOI":"10.1109\/CASE49997.2022.9926690"},{"key":"ref_13","first-page":"450","article-title":"Scheduling and control of high throughput screening systems with uncertainties and disturbances","volume":"10","author":"Oke","year":"2022","journal-title":"Prod. Manuf. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"7667","DOI":"10.1109\/TSMC.2022.3161643","article-title":"A Novel control-theory-based approach to scheduling of high-throughput screening system for enzymatic assay","volume":"52","author":"Wu","year":"2022","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/S0377-2217(96)00272-X","article-title":"An improved algorithm for cyclic flowshop scheduling in a robotic cell","volume":"97","author":"Levner","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"ref_16","unstructured":"Brunsch, T. (2013). Modeling and Control of Complex Systems in a Dioid Framework. [Ph.D. Thesis, Technische Universit\u00e4t]. Available online: https:\/\/depositonce.tu-berlin.de\/bitstream\/11303\/4264\/2\/brunsch_thomas.pd."},{"key":"ref_17","first-page":"215","article-title":"PERT and CPM in project management with practical examples","volume":"11","author":"Bagshaw","year":"2021","journal-title":"Am. J. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Vanhoucke, M., and Vanhoucke, M. (2013). Project Management with Dynamic Scheduling: Baseline Scheduling, Risk Analysis and Project Control, Springer.","DOI":"10.1007\/978-3-642-40438-2"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Lin, S.P., and Huang, D. (2020). Project Management under Internet Era, Springer.","DOI":"10.1007\/978-981-15-2799-9"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1080\/00207540802552659","article-title":"Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times","volume":"48","author":"Che","year":"2010","journal-title":"Int. J. Prod. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0166-218X(98)00054-7","article-title":"A parametric critical path problem and an application for cyclic scheduling","volume":"87","author":"Levner","year":"1998","journal-title":"Discret. Appl. Math."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Pang, X., Xue, H., Tseng, M.-L., Lim, M.K., and Liu, K. (2020). Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation. Appl. Sci., 10.","DOI":"10.3390\/app10031174"},{"key":"ref_23","unstructured":"Janzen, W.P., and Bernasconi, P. (2009). Methods in Molecular Biology, Humana Press."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.matcom.2003.11.004","article-title":"Time-optimal scheduling for high throughput screening processes using cyclic discrete event models","volume":"66","author":"Mayer","year":"2004","journal-title":"Math. Comput. Simul."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1177\/1087057108319644","article-title":"The future of high-throughput screening","volume":"13","author":"Mayr","year":"2008","journal-title":"SLAS Discov."},{"key":"ref_26","first-page":"469","article-title":"Modeling and optimization for high throughput-screening systems","volume":"37","author":"Mayer","year":"2004","journal-title":"Proc. IFAC"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10626-008-0038-3","article-title":"Throughput optimal sequences for cyclically operated plants","volume":"18","author":"Mayer","year":"2008","journal-title":"Discrete Event Dyn. Syst."},{"key":"ref_28","first-page":"522","article-title":"A multistage technological process","volume":"6","author":"Suprunenko","year":"1962","journal-title":"Dokl. Acad. Nauk BSSR"},{"key":"ref_29","first-page":"224","article-title":"Multi-operator cyclic processes","volume":"7","author":"Aizenshtat","year":"1963","journal-title":"Dokl. Byeloruss. Acad. Sci."},{"key":"ref_30","first-page":"111","article-title":"A scheduling problem for a flowshop line with a single operator","volume":"7","author":"Tanaev","year":"1964","journal-title":"Eng. Phys. J."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/3\/127\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:15:50Z","timestamp":1760105750000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/3\/127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,19]]},"references-count":30,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["a17030127"],"URL":"https:\/\/doi.org\/10.3390\/a17030127","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2024,3,19]]}}}