Efficient approximation schemes for scheduling problems with release dates and delivery times

DOI10.1023/A:1026272526225zbMATH Open1154.90473OpenAlexW1484610295MaRDI QIDQ2464403FDOQ2464403

Authors: Monaldo Mastrolilli 

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

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (34)

• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
• Grouping techniques for scheduling problems: simpler and faster
• Title not available (Why is that?)
• Two approximation schemes for scheduling on parallel machines under a grade of service provision
• PTAS for a two-machine flow-shop scheduling problem with release dates and transportation times delay
• A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
• Scheduling Algorithms for Single Machine Problem with Release and Delivery Times
• Scheduling parallel machines with inclusive processing set restrictions and job release times
• Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
• Jackson's semi-preemptive scheduling on a single machine
• An exact approach to early/tardy scheduling with release dates
• Integrated production and outbound distribution scheduling problems with job release dates and deadlines
• Integrated scheduling of production and distribution with release dates and capacitated deliveries
• Polynomial-time approximation schemes for scheduling problems with time lags
• 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
• Online scheduling on two parallel machines with release times and delivery times
• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
• Performance guarantees for a scheduling problem with common stepwise job payoffs
• Scheduling with tree-hierarchical processing set restrictions
• Exact and approximate methods for parallel multiple-area spatial scheduling with release times
• Minimizing the maximum lateness for scheduling with release times and job rejection
• A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
• A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
• Parallel batch scheduling with nested processing set restrictions
• Scheduling jobs with sizes and delivery times on identical parallel batch machines
• Parallel machine scheduling with nested processing set restrictions and job delivery times
• Single-machine time-dependent scheduling with proportional and delivery times
• A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
• An efficient PTAS for semiconductor burn-in scheduling with release dates to minimize maximum delivery time
• Online scheduling on two parallel machines with release dates and delivery times
• A best on-line algorithm for single machine scheduling with small delivery times
• Title not available (Why is that?)
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection

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)