Pages that link to "Item:Q2784510"

The following pages link to Single Machine Scheduling with Release Dates (Q2784510):

Displaying 36 items.

• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
• The expected asymptotical ratio for preemptive stochastic online problem (Q391147) (← links)
• Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
• Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
• On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
• Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines (Q763104) (← links)
• Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
• Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
• An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
• Resource cost aware scheduling (Q1750475) (← links)
• A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
• Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
• Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
• Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
• An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002) (← links)
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
• Online scheduling to minimize the total weighted completion time plus the rejection cost (Q2410099) (← links)
• A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
• Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684) (← links)
• Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
• Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
• A \(2.28\)-competitive algorithm for online scheduling on identical machines (Q2514649) (← links)
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
• An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
• Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← links)
• Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
• (Q3304142) (← links)
• On competitive analysis for polling systems (Q6072151) (← links)
• Joint replenishment meets scheduling (Q6102849) (← links)
• Single machine scheduling with release dates: a distributionally robust approach (Q6112405) (← links)