Abstract
The problem of cyclic scheduling under the requirement of throughput maximization is considered for a special class of cyclically repeated batch processes. All batches have to follow an identical time scheme. The same resource may be visited more than ouce by the same batch and time window constraints may be stated by the user. It is shown that the cyclic scheduling problem can be transformed into a mixed integer linear optimization problem. The method'sapplication to High-Throughput-Screening processes is demonstrated.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
