Throughput-optimal sequences for cyclically operated plants

DOI10.1007/S10626-008-0038-3MaRDI QIDQ732253zbMATH OpenOpenAlexFDO

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

Publication date 9 October 2009

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

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

Recommendations

• Cyclic just-in-time sequences are optimal
• Optimization of operation of sequential systems
• Optimal sequencing of production and inspection operations
• Optimal staffing for cyclically scheduled processes
• Optimality of the cyclic sequence on bottleneck product rate variation problem with a general objective
• Optimal Cycle Times in Multistage Serial Systems with Set-Up and Inventory Costs
• Optimal sequences in stochastic single machine shops
• scientific article; zbMATH DE number 3908131
• Optimal Sequencing in Multiserver Systems

Cites work

• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• scientific article; zbMATH DE number 846900 (Why is no real title available?)
• A parametric critical path problem and an application for cyclic scheduling
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Assignment and sequencing models for the scheduling of process systems
• Cyclic Schedules for Job Shops with Identical Jobs
• Cyclic scheduling in robotic flowshops
• On scheduling cycle shops: Classification, complexity and approximation
• Optimal periodic scheduling of multipurpose batch plants
• Performance Measures and Schedules in Periodic Job Shops
• The complexity of cyclic shop scheduling problems
• Time-optimal scheduling for high throughput screening processes using cyclic discrete event models

Cited in

(2)

• Time-optimal scheduling for high throughput screening processes using cyclic discrete event models
• Networked conflicting timed event graphs representation in (Max,+) algebra

Describes a project that uses

Uses Software

• CPLEX

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

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