Determining the optimal starting times in a cyclic schedule with a given route

DOI10.1016/0305-0548(93)90102-OzbMATH Open0781.90053OpenAlexW2078478455MaRDI QIDQ1310046FDOQ1310046

Authors: Lei Lei 

Publication date: 2 January 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90102-o

Recommendations

• Minimizing the fleet size with dependent time-window and single-track constraints
• 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
• Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints

zbMATH Keywords

time-windowscyclic transportation schedulegiven routeoptimal integer starting times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Cites Work

• A Mathematical Model for Periodic Scheduling Problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
• The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
• Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure
• Title not available (Why is that?)

Cited In (14)

• Overlapping Start-Time Bands in Implicit Tour Scheduling
• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• 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
• A parametric critical path problem and an application for cyclic scheduling
• Bounds and tabu search for a cyclic max-min scheduling problem
• A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
• A solution for cyclic scheduling of multi-hoists without overlapping
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• On-line scheduling in a surface treatment system
• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
• Minimizing the fleet size with dependent time-window and single-track constraints
• Time-optimal scheduling for high throughput screening processes using cyclic discrete event models
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints

This page was built for publication: Determining the optimal starting times in a cyclic schedule with a given route

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