propose a modified greedy algorithm to address time lag constraints among operations by rejecting infeasible schedules in local searches. While these heuristic methods provide solutions with low computational complexity, the obtained solutions can be far from optimal. Few studies describe formal mathematical formulations of laboratory operation schedulers, and, to the best of our knowledge, only the study by Itoh et al. achieves mathematically optimal solutions. However, while Itoh et al. consider constraints on temporal boundaries of operations (time lags) for life science laboratory, the formulation still lacks other constraints that are important to generic library synthesis scenarios. For example, module capacity, as illustrated in the aforementioned multi-position heater case, and work shifts, where some operations can only be performed in predefined time slots. It should also be noted that not all of these previous schedulers were designed for the synthesis of chemical libraries.