Publication | Closed Access
A heuristic algorithm for the computation of cyclic schedules and the necessary WIP to obtain optimal cycle time
13
Citations
7
References
2002
Year
Unknown Venue
Mathematical ProgrammingEngineeringIndustrial EngineeringComputational ComplexityNecessary WipOptimal System DesignOperations ResearchSystems EngineeringCombinatorial OptimizationCyclic ScheduleOptimal Cycle TimeComputer EngineeringScheduling (Computing)Computer ScienceCyclic SchedulesInteger ProgrammingScheduling AnalysisHeuristic AlgorithmEnergy ManagementScheduling ProblemScheduling (Operating Systems)AutomationProduction SchedulingScheduling (Production Processes)Real-time SystemsScheduling (Project Management)Resource Optimization
Presents a heuristic algorithm to determine a cyclic schedule with optimal cycle time while minimizing the work in process (WIP). The respect of the optimal cycle time is a hard constraint during the computation of the schedule, while the minimization of the WIP is considered as an objective. The algorithm builds the schedule progressively and its complexity allows the use under real-time constraints.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1