Pages that link to "Item:Q1288216"

The following pages link to Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs (Q1288216):

Displaying 22 items.

• Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
• Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
• A survey of results for sequencing problems with controllable processing times (Q908846) (← links)
• Complexity of a scheduling problem with controllable processing times (Q969518) (← links)
• Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
• Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems (Q1288217) (← links)
• Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case (Q1288289) (← links)
• Single machine scheduling of unit-time jobs with controllable release dates (Q1407253) (← links)
• Some comments on sequencing with controllable processing times (Q1599819) (← links)
• Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
• Semi-definite relaxation algorithm for single machine scheduling with controllable processing times (Q1774270) (← links)
• Minimizing the total weighted flow time in a single machine with controllable processing times (Q1886005) (← links)
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Scheduling with controllable release dates and processing times: Makespan minimization (Q2433440) (← links)
• Scheduling with controllable release dates and processing times: total completion time minimization (Q2433441) (← links)
• Single machine scheduling with controllable release and processing parameters (Q2433805) (← links)
• Two-machine open shop problem with controllable processing times (Q2467128) (← links)
• Scheduling with controllable processing times and compression costs using population-based heuristics (Q3168916) (← links)
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy (Q4205229) (← links)