Pages that link to "Item:Q2464403"

The following pages link to Efficient approximation schemes for scheduling problems with release dates and delivery times (Q2464403):

Displaying 32 items.

• Performance guarantees for a scheduling problem with common stepwise job payoffs (Q476886) (← links)
• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times (Q496647) (← links)
• A simulated annealing approach to minimize the maximum lateness on uniform parallel machines (Q552090) (← links)
• Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection (Q681293) (← links)
• Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
• Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
• Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
• Integrated production and outbound distribution scheduling problems with job release dates and deadlines (Q1617275) (← links)
• An exact approach to early/tardy scheduling with release dates (Q1781563) (← links)
• Parallel machine scheduling with nested processing set restrictions and job delivery times (Q1792963) (← links)
• Integrated scheduling of production and distribution with release dates and capacitated deliveries (Q1793780) (← links)
• Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
• The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine (Q1951910) (← links)
• Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
• Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) (← links)
• Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
• Exact and approximate methods for parallel multiple-area spatial scheduling with release times (Q2393121) (← links)
• Parallel batch scheduling with nested processing set restrictions (Q2402265) (← links)
• A best on-line algorithm for single machine scheduling with small delivery times (Q2481972) (← links)
• A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)
• A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097) (← links)
• Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES (Q3526523) (← links)
• A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem (Q4294730) (← links)
• TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION (Q4649879) (← links)
• (Q4783488) (← links)
• Scheduling with tree-hierarchical processing set restrictions (Q4986067) (← links)
• A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan (Q5244301) (← links)
• Scheduling Algorithms for Single Machine Problem with Release and Delivery Times (Q6110178) (← links)
• Single-machine time-dependent scheduling with proportional and delivery times (Q6542862) (← links)
• Minimizing the maximum lateness for scheduling with release times and job rejection (Q6646743) (← links)