Pages that link to "Item:Q1304510"

The following pages link to The time dependent machine makespan problem is strongly NP-complete (Q1304510):

Displaying 9 items.

• The complexity of scheduling starting time dependent tasks with release times (Q293188) (← links)
• ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
• A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
• A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times (Q1758042) (← links)
• Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine (Q1869884) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time (Q5320231) (← links)
• Single machine scheduling with step-deteriorating processing times (Q5952512) (← links)
• A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)