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.030MaRDI QIDQ2467264zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Parametric algorithms for 2-cyclic robot scheduling with interval processing times
• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
• Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints
• An improved algorithm for cyclic flowshop scheduling in a robotic cell

Cites work

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

Cited in

(7)

• Determining the optimal starting times in a cyclic schedule with a given route
• Switched max-plus linear-dual inequalities: cycle time analysis and applications
• A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• A branch and bound algorithm for the cyclic job-shop problem with transportation
• Parametric algorithms for 2-cyclic robot scheduling with interval processing times
• Robust optimization for the cyclic hoist scheduling problem

Describes a project that uses

Uses Software

• PESPLib

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)