Single machine scheduling with release dates
From MaRDI portal
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(53)- LP-based online scheduling: From single to parallel machines
- Minimizing average completion time in the presence of release dates
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Approximation algorithms for shop scheduling problems with minsum objective
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- Resource cost aware scheduling
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Lower bounds for on-line single-machine scheduling.
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- A global constraint for total weighted completion time for unary resources
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
- Computation of approximate -points for large scale single machine scheduling problem
- Designing PTASs for MIN-SUM scheduling problems
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
- A \(2.28\)-competitive algorithm for online scheduling on identical machines
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Approximation techniques for average completion time scheduling
- Near-optimal solutions of large-scale single-machine scheduling problems
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Scheduling with Outliers
- The expected asymptotical ratio for preemptive stochastic online problem
- A supermodular relaxation for scheduling with release dates
- Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
- Scheduling Unrelated Machines by Randomized Rounding
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
- Approximability of average completion time scheduling on unrelated machines
- Stochastic Online Scheduling Revisited
- On competitive analysis for polling systems
- Joint replenishment meets scheduling
- Single machine scheduling with release dates: a distributionally robust approach
- A competitive online algorithm for minimizing total weighted completion time on uniform machines
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Fifty years of research in scheduling -- theory and applications
- Improved online scheduling with restarts on a single machine
- Cost-sharing in parking games
- The problem of one machine with equal processing time and preemption
- On-line scheduling to minimize average completion time revisited.
- Improved online scheduling with restarts on a single machine
- A joint scheduling approach for production and material handling under customized manufacturing paradigm
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
- Analysis of bounds for a capacitated single-item lot-sizing problem
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
This page was built for publication: Single machine scheduling with release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784510)
