Efficient approximation schemes for scheduling problems with release dates and delivery times
From MaRDI portal
Publication:2464403
DOI10.1023/A:1026272526225zbMath1154.90473OpenAlexW1484610295MaRDI QIDQ2464403
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026272526225
Related Items (21)
Integrated production and outbound distribution scheduling problems with job release dates and deadlines ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Scheduling jobs with sizes and delivery times on identical parallel batch machines ⋮ The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine ⋮ A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions ⋮ SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES ⋮ Grouping techniques for scheduling problems: simpler and faster ⋮ Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times ⋮ Improved approximation algorithms for parallel machine scheduling with release dates and job rejection ⋮ TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION ⋮ A best on-line algorithm for single machine scheduling with small delivery times ⋮ A simulated annealing approach to minimize the maximum lateness on uniform parallel machines ⋮ Jackson's semi-preemptive scheduling on a single machine ⋮ Scheduling jobs with release and delivery times subject to nested eligibility constraints ⋮ 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 ⋮ A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan ⋮ Scheduling parallel machines with inclusive processing set restrictions and job release times ⋮ Online Scheduling on Two Parallel Machines with Release Times and Delivery Times ⋮ Online scheduling on two parallel machines with release dates and delivery times
This page was built for publication: Efficient approximation schemes for scheduling problems with release dates and delivery times
