Pages that link to "Item:Q1334634"

The following pages link to Complexity of scheduling tasks with time-dependent execution times (Q1334634):

Displaying 49 items.

• The complexity of scheduling starting time dependent tasks with release times (Q293188) (← links)
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties (Q454994) (← links)
• Single machine group scheduling with decreasing time-dependent processing times subject to release dates (Q470781) (← links)
• Scheduling linearly shortening jobs under precedence constraints (Q552447) (← links)
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
• Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties (Q638880) (← links)
• Single-machine scheduling problems with time and position dependent processing times (Q646660) (← links)
• Scheduling on a single processor with variable speed (Q673343) (← links)
• Scheduling with time-dependent execution times (Q673610) (← links)
• Scheduling jobs with varying processing times (Q673617) (← links)
• Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
• Preemptive repayment policy for multiple loans (Q763209) (← links)
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960) (← links)
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
• Flow shop scheduling with effects of learning and deterioration (Q949265) (← links)
• Scheduling time-dependent jobs under mixed deterioration (Q963924) (← links)
• Learning effect and deteriorating jobs in the single machine scheduling problems (Q965543) (← links)
• A note on single-machine scheduling with decreasing time-dependent job processing times (Q967802) (← links)
• Single machine scheduling with decreasing linear deterioration under precedence constraints (Q980093) (← links)
• Conjugate problems in time-dependent scheduling (Q1041348) (← links)
• Scheduling jobs under decreasing linear deterioration (Q1041725) (← links)
• Equivalent time-dependent scheduling problems (Q1041934) (← links)
• A note on scheduling on a single processor with speed dependent on a number of executed jobs (Q1351619) (← links)
• A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times (Q1608433) (← links)
• Single machine scheduling problems with deteriorating jobs (Q1764739) (← links)
• Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine (Q1869884) (← links)
• A note on single-processor scheduling with time-dependent execution times (Q1905074) (← links)
• Parallel machine scheduling with time dependent processing times (Q1923596) (← links)
• Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Single-machine scheduling problems with precedence constraints and simple linear deterioration (Q2337543) (← links)
• Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines (Q2370335) (← links)
• Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs (Q2399611) (← links)
• Two-agent scheduling of time-dependent jobs (Q2410089) (← links)
• Single machine group scheduling under decreasing linear deterioration (Q2454982) (← links)
• Parallel-machine scheduling with time dependent processing times (Q2481965) (← links)
• Scheduling in a contaminated area: a model and polynomial algorithms (Q2491774) (← links)
• Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (Q2688577) (← links)
• Permutation flow shop problem with shortening job processing times (Q2821099) (← links)
• Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures (Q2931176) (← links)
• SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING (Q3439889) (← links)
• Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm (Q4972548) (← links)
• A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (Q5059405) (← links)
• A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time (Q5320231) (← links)
• Greedy solutions of selection and ordering problems (Q5945209) (← links)
• Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components (Q6135731) (← links)