Pages that link to "Item:Q794156"

The following pages link to Minimizing completion time for a class of scheduling problems (Q794156):

Displaying 21 items.

• TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
• Reducing the solution space of optimal task scheduling (Q336912) (← links)
• Minimizing setups in ordered sets of fixed width (Q762183) (← links)
• Jump number problem: The role of matroids (Q1057289) (← links)
• An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
• Interval orders without odd crowns are defect optimal (Q1079584) (← links)
• A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
• A variant of time minimizing assignment problem (Q1303581) (← links)
• The setup polyhedron of series-parallel posets (Q1372744) (← links)
• A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
• A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay (Q2069704) (← links)
• Minimizing task completion time with the execution set method (Q2467305) (← links)
• Quality of move-optimal schedules for minimizing total weighted completion time (Q2480059) (← links)
• Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
• A note on scheduling coupled tasks for minimum total completion time (Q2678608) (← links)
• (Q3569627) (← links)
• (Q3683872) (← links)
• Minimizing the Range of Order Completion Times with Multiple Job Classes (Q4273304) (← links)
• Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance (Q4456055) (← links)
• (Q5490470) (← links)
• An heuristic approach for solving OSSP with a objective of minimizing total completion time and resource idleness (Q6051979) (← links)