A parametric critical path problem and an application for cyclic scheduling

DOI10.1016/S0166-218X(98)00054-7zbMath0906.68108MaRDI QIDQ1270778

Eugene Levner, Vladimir Kats

Publication date: 25 January 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

PERT networkscyclic scheduling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (18)

The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory ⋮ Cyclic scheduling in a robotic production line ⋮ Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows ⋮ Cyclic multiple-robot scheduling with time-window constraints using a critical path approach ⋮ Grouping tasks to save energy in a cyclic scheduling problem: a complexity study ⋮ Scheduling in reentrant robotic cells: algorithms and complexity ⋮ A faster polynomial algorithm for 2-cyclic robotic scheduling ⋮ A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times ⋮ A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule ⋮ Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays ⋮ Parametric algorithms for 2-cyclic robot scheduling with interval processing times ⋮ A mixed integer programming model for the cyclic job-shop problem with transportation ⋮ Steady state analysis of timed event graphs with time window constraints ⋮ Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints ⋮ An efficient bicriteria algorithm for stable robotic flow shop scheduling ⋮ A solution approach to find the critical path in a time-constrained activity network ⋮ Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants ⋮ Throughput-optimal sequences for cyclically operated plants

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic approach to hard constrained shortest path problems
• Parametric shortest path algorithms with an application to cyclic staffing
• Determining the optimal starting times in a cyclic schedule with a given route
• A network flow algorithm for just-in-time project scheduling
• An exact optimal cyclic scheduling algorithm for multioperator service of a production line
• Finding minimum cost to time ratio cycles with small integral transit times
• A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES
• A primal-dual algorithm for the minimum average weighted length circuit problem
• On a parametric shortest path problem from primal—dual multicommodity network optimization
• Performance Measures and Schedules in Periodic Job Shops
• Faster parametric shortest path and minimum‐balance algorithms

This page was built for publication: A parametric critical path problem and an application for cyclic scheduling