What people are saying - Write a review
We haven't found any reviews in the usual places.
Section II Development of the Coupling Methodology
Section III Experimental Results and Analysis
Section IV Summary Conclusion and Suggestions
6.83 direction Test basic processing Best Schedule changes cost CM CM CM Cost Components criterion cost of length cost of processing cost of tardiness Coupling Using Tardiness Coupling with Tardiness Coupling with VIOLAT directional coupling Directional Procedure TABLE feasible schedule feasible sequence formulation Gantt chart Heuristic Scheduling Procedure HSP runs number HSP schedule HSP seeks HSP sequence integer programming job due dates job shop problem length of overtime linear program LP model LP objective function LP objective value LP runs total marginal costs maximum tardiness minimum LP objective Modified One Directional number of HSP number of LP objective function value objective value reduction operation precedence constraints optimal solutions overtime objective value overtime period problem with due processing time changes reduction from SLACK run HSP runs total CPU(step Schedule for Test seconds objective value SLACK sequence 7.5 tardiness cost Tardiness TABLE thesis Tmax VIOLAT Removal VIOLAT=0