Pages that link to "Item:Q3983500"

The following pages link to A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling (Q3983500):

Displaying 8 items.

• Scheduling with tool changes to minimize total completion time: Basic results and SPT performance (Q703937) (← links)
• A note on worst-case performance of heuristics for maintenance scheduling problems (Q868400) (← links)
• A note on a proof of SPT optimality for single-machine sequencing problems via the transportation problem (Q909576) (← links)
• A note on the SPT heuristic for solving scheduling problems with generalized due dates (Q1433162) (← links)
• The CLWS heuristic for single machine scheduling problem (Q1969836) (← links)
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254) (← links)
• Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags (Q2564876) (← links)
• WORST-CASE ANALYSIS OF INDEXING RULES FOR SINGLE MACHINE SEQUENCING (Q4294130) (← links)