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.030zbMATH Open1137.90495OpenAlexW2025833759MaRDI QIDQ2467264FDOQ2467264
Lei Lei, Vladimir Kats, Eugene Levner
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
Deterministic scheduling theory in operations research (90B35) Production theory, theory of the firm (91B38)
Cites Work
- A Mathematical Model for Periodic Scheduling Problems
- Introduction to algorithms
- A survey of scheduling problems with setup times or costs
- 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
- The basic cyclic scheduling problem with deadlines
- Complexity results for parallel machine problems with a single server
- Cyclic scheduling in robotic flowshops
- A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints
- Part sequencing in three-machine no-wait robotic cells
- Scheduling large robotic cells without buffers
- The complexity of cyclic shop scheduling problems
- Performance Measures and Schedules in Periodic Job Shops
- A parametric critical path problem and an application for cyclic scheduling
- An algorithm for finding shortest routes from all source nodes to a given destination in general networks
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- Determining the optimal starting times in a cyclic schedule with a given route
- Scheduling Parallel Computations
Cited In (7)
- 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
- Robust optimization for the cyclic hoist scheduling problem
- A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
- A branch and bound algorithm for the cyclic job-shop problem with transportation
- Determining the optimal starting times in a cyclic schedule with a given route
- Switched max-plus linear-dual inequalities: cycle time analysis and applications
Uses Software
This page was built for publication: Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467264)
