Throughput-optimal sequences for cyclically operated plants

DOI10.1007/s10626-008-0038-3zbMath1176.90232OpenAlexW1985283861MaRDI QIDQ732253

Jörg Raisch, Utz-Uwe Haus, Eckart Mayer, Robert Weismantel

Publication date: 9 October 2009

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-008-0038-3

zbMATH Keywords

integer programmingcyclic schedulinghigh throughput screening

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Discrete event control/observation systems (93C65)

Related Items (1)

Networked conflicting timed event graphs representation in (Max,+) algebra

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Assignment and sequencing models for the scheduling of process systems
• A parametric critical path problem and an application for cyclic scheduling
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Cyclic scheduling in robotic flowshops
• On scheduling cycle shops: Classification, complexity and approximation
• The complexity of cyclic shop scheduling problems
• Time-optimal scheduling for high throughput screening processes using cyclic discrete event models
• Optimal periodic scheduling of multipurpose batch plants
• Cyclic Schedules for Job Shops with Identical Jobs
• Performance Measures and Schedules in Periodic Job Shops

This page was built for publication: Throughput-optimal sequences for cyclically operated plants