Flow Time Reduction for Multistage Cyclic Scheduling with Multiple, Partially Ordered JobsThis research attempts to develop novel flow-time solutions for a class of extended cyclic scheduling problems in a repetitive manufacturing environment. |
Common terms and phrases
algorithm Ap 1 Ap arcs assigned to machine Assignment Results Best Assignments Found Best Solutions Found CC Average CC Finishes CC Finishes sec Chapter Coarse Compression Compression After Coarse constraints Copt cycle length cycle offset cyclic scheduling problem denote FC Finishes FC Finishes sec FCSP feasible cyclic schedule Fine Compression free path segment global left shift graph H Initial Makespan No-Wait Instances Percent job routings Job Sequence Best Job Shop Instances job shop problem LB After CC LB After FC linear programming Lmar Lower Bound Percent LP LB LP Lower Bound Mach Mach 3 Mach Makespan No-Wait Job minimized no-wait cyclic schedule No-Wait Job Sequence node NP-hard optimal P//Cmax Partial Order Routing Percent Above WTFT Problem Size Problems at 75 processing R//Cmar ReRoute Results for 5x5 routing graph Section Sequence Best Solutions serial line Single Shifts slack-tolerance subproblem subroutine techniques variables WTFT LB WTFT Lower Bound