Pages that link to "Item:Q1179195"

The following pages link to Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times (Q1179195):

Displaying 13 items.

• An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
• A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times (Q1268839) (← links)
• Preemptive scheduling with release dates, delivery times and sequence independent setup times (Q1331546) (← links)
• Batch scheduling to minimize maximum lateness (Q1373461) (← links)
• A sequencing problem with family setup times (Q1917311) (← links)
• An uncertain programming model for single machine scheduling problem with batch delivery (Q2313751) (← links)
• Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← links)
• Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
• Effective heuristics for the single machine sequencing problem with ready times (Q3352822) (← links)
• WORST-CASE ANALYSIS OF INDEXING RULES FOR SINGLE MACHINE SEQUENCING (Q4294130) (← links)
• MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING (Q4345050) (← links)
• (Q5297390) (← links)
• A heuristic approach for single-machine scheduling with due dates and class setups. (Q5945318) (← links)