期刊
SLAS TECHNOLOGY
卷 26, 期 6, 页码 650-659出版社
ELSEVIER SCIENCE INC
DOI: 10.1177/24726303211021790
关键词
scheduling; laboratory automation (LA); time constraint by mutual boundaries (TCMB); branch-and-bound algorithm
资金
- JST-Mirai Program [JPMJMI18G4]
This study introduces a new method for scheduling problems in laboratory automation, aiming to minimize the time required to complete experiments while taking into account the time constraints between operations. Through mixed-integer programming and branch-and-bound algorithm, researchers have successfully proposed an effective scheduling method.
In automated laboratories consisting of multiple different types of instruments, scheduling algorithms are useful for determining the optimal allocations of instruments to minimize the time required to complete experimental procedures. However, previous studies on scheduling algorithms for laboratory automation have not emphasized the time constraints by mutual boundaries (TCMBs) among operations, which is important in procedures involving live cells or unstable biomolecules. Here, we define the scheduling for laboratory automation in biology (S-LAB) problem as a scheduling problem for automated laboratories in which operations with TCMBs are performed by multiple different instruments. We formulate an S-LAB problem as a mixed-integer programming (MIP) problem and propose a scheduling method using the branch-and-bound algorithm. Simulations show that our method can find the optimal schedules of S-LAB problems that minimize overall execution time while satisfying the TCMBs. Furthermore, we propose the use of our scheduling method for the simulation-based design of job definitions and laboratory configurations.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据