Flow time reduction for multistage cyclic scheduling with multiple, Partially ordered jobs
This research attempts to develop novel flow-time solutions for a class of extended cyclic scheduling problems in a repetitive manufacturing environment.
What people are saying - Write a review
We haven't found any reviews in the usual places.
algorithm Approach arcs assembly routing assigned to machine Best Solutions Found Chapter Coarse Compression consider constraints Core Results cycle length cyclic precedence structure cyclic scheduling problem denote equivalence class FC Finishes sec FCSP feasible cyclic schedule first-last pair free path segment given global left shift graph H Initial Makespan No-Wait job compression job routings Job Sequence Best Job Shop Instances job shop problem LB After CC LB After FC LB Before SS linear programming Lmax LP LB Mach Makespan No-Wait Job makespan objective minimized no-wait cyclic schedule No-Wait Job Sequence node NP-complete NP-hard num-compressions objective function optimal overall makespan partial order routing problem instances Problem Size Problems at 95 processing R//Cmax ReRoute routing graph Section Sequence Best Solutions set of operations Single Shifts slack-tolerance Solutions Found Figure SS Average subroutine tabu search techniques traveling salesman problem Util 95 utilization level WLOG WTFT LB WTFT lower bound