Time-optimal scheduling for high throughput screening processes using cyclic discrete event models

DOI10.1016/J.MATCOM.2003.11.004MaRDI QIDQ1826591zbMATH OpenOpenAlexFDO

Authors Eckart Mayer, Jörg Raisch

Publication date 6 August 2004

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.matcom.2003.11.004

zbMATH Keywords

Discrete event systemsCyclic schedulingHigh throughput screeningMixed integer optimizationThroughput maximization

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Recommendations

• Throughput-optimal sequences for cyclically operated plants
• A general model for cyclic machine scheduling problems
• Determining the optimal starting times in a cyclic schedule with a given route
• scientific article; zbMATH DE number 1437392
• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach

Cited in

(4)

• Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms
• scientific article; zbMATH DE number 1852165 (Why is no real title available?)
• Throughput-optimal sequences for cyclically operated plants
• Switched max-plus linear-dual inequalities: cycle time analysis and applications

This page was built for publication: Time-optimal scheduling for high throughput screening processes using cyclic discrete event models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1826591)