Efficient approximation schemes for scheduling problems with release dates and delivery times
From MaRDI portal
Publication:2464403
Recommendations
- Approximation Algorithms for Scheduling Problems with Exact Delays
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
- Efficient heuristics to minimize total flow time with release dates
- An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
- Scheduling with controllable release dates and processing times: total completion time minimization
- scientific article; zbMATH DE number 1560337
- On approximating a scheduling problem
- Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates
Cited in
(38)- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- An exact approach to early/tardy scheduling with release dates
- Parallel machine scheduling with nested processing set restrictions and job delivery times
- Integrated scheduling of production and distribution with release dates and capacitated deliveries
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Online scheduling on two parallel machines with release dates and delivery times
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times
- Parallel batch scheduling with nested processing set restrictions
- A best on-line algorithm for single machine scheduling with small delivery times
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
- Online scheduling on two parallel machines with release times and delivery times
- SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
- PTAS for a two-machine flow-shop scheduling problem with release dates and transportation times delay
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
- Two approximation schemes for scheduling on parallel machines under a grade of service provision
- Performance guarantees for a scheduling problem with common stepwise job payoffs
- scientific article; zbMATH DE number 1841981 (Why is no real title available?)
- scientific article; zbMATH DE number 1893571 (Why is no real title available?)
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
- Scheduling with tree-hierarchical processing set restrictions
- A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
- An efficient PTAS for semiconductor burn-in scheduling with release dates to minimize maximum delivery time
- A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
- Polynomial-time approximation schemes for scheduling problems with time lags
- Scheduling Algorithms for Single Machine Problem with Release and Delivery Times
- Single-machine time-dependent scheduling with proportional and delivery times
- Minimizing the maximum lateness for scheduling with release times and job rejection
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
- Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities
- Revisiting the development trajectory of parallel machine scheduling
- Branch-and-bound algorithms as polynomial-time approximation schemes
- Grouping techniques for scheduling problems: simpler and faster
- Jackson's semi-preemptive scheduling on a single machine
This page was built for publication: Efficient approximation schemes for scheduling problems with release dates and delivery times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464403)
