Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints

DOI10.1016/j.ejor.2006.07.030zbMath1137.90495OpenAlexW2025833759MaRDI QIDQ2467264

Lei Lei, Eugene Levner, Vladimir Kats

Publication date: 21 January 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.030

zbMATH Keywords

time windowsmultiple productsrobotcyclic scheduling with setups

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production theory, theory of the firm (91B38)

Related Items

Robust optimization for the cyclic hoist scheduling problem ⋮ A branch and bound algorithm for the cyclic job-shop problem with transportation ⋮ A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times ⋮ Parametric algorithms for 2-cyclic robot scheduling with interval processing times

Uses Software

• PESPLib

Cites Work

• Unnamed Item
• The basic cyclic scheduling problem with deadlines
• A parametric critical path problem and an application for cyclic scheduling
• Determining the optimal starting times in a cyclic schedule with a given route
• A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
• Cyclic scheduling in a robotic production line
• Scheduling large robotic cells without buffers
• Cyclic scheduling in robotic flowshops
• The complexity of cyclic shop scheduling problems
• A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
• Complexity results for parallel machine problems with a single server
• A survey of scheduling problems with setup times or costs
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• A Mathematical Model for Periodic Scheduling Problems
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• Performance Measures and Schedules in Periodic Job Shops
• Scheduling Parallel Computations
• An algorithm for finding shortest routes from all source nodes to a given destination in general networks
• Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints
• Part sequencing in three-machine no-wait robotic cells