SAGAS: Simulated annealing and greedy algorithm scheduler for laboratory automation

SAGAS: Simulated annealing and greedy algorithm scheduler for laboratory automation

During laboratory automation of life science experiments, coordinating specialized instruments and human experimenters for various experimental procedures is important to minimize the execution time. In particular, the scheduling of life science experiments requires the consideration of time constra...

Full description

Bibliographic Details
Main Authors: Yuya Arai, Ko Takahashi, Takaaki Horinouchi, Koichi Takahashi, Haruka Ozaki
Format: Article
Language:English
Published: Elsevier 2023-08-01
Series:SLAS Technology
Subjects:
Scheduling
Laboratory automation
Time constraint by mutual boundaries (TCMB)
Scheduling for laboratory automation in biology (S-LAB) problem
Simulated annealing (SA)
Greedy algorithm
Online Access:http://www.sciencedirect.com/science/article/pii/S2472630323000195

Internet

http://www.sciencedirect.com/science/article/pii/S2472630323000195

Similar Items