Pages that link to "Item:Q3893644"

The following pages link to Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times (Q3893644):

Displaying 34 items.

• Scheduling a single machine with primary and secondary objectives (Q2331605) (← links)
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time (Q2342682) (← links)
• Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
• On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time (Q2434291) (← links)
• Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← links)
• A best on-line algorithm for single machine scheduling with small delivery times (Q2481972) (← links)
• Asymptotically optimal schedules for single-server flow shop problems with setup costs and times (Q2488240) (← links)
• Minimizing flowtime and missed due-dates in single-machine sequencing (Q2640435) (← links)
• Integrated scheduling problem on a single bounded batch machine with an unavailability constraint (Q2657417) (← links)
• A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)
• Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
• Analysis of a linearization heuristic for single-machine scheduling to maximize profit (Q3313596) (← links)
• Effective heuristics for the single machine sequencing problem with ready times (Q3352822) (← links)
• Integration of finished goods batch delivery into production scheduling via total tardiness minimization (Q3512025) (← links)
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates (Q3705209) (← links)
• A Sequencing Problem with Release Dates and Clustered Jobs (Q3731355) (← links)
• One-machine sequencing with release dates, delivery times and precedence constraints (Q3988227) (← links)
• Approximation scheduling algorithms: a survey (Q4207781) (← links)
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265) (← links)
• Scheduling batch processing machines with incompatible job families (Q4399080) (← links)
• A modified shifting bottleneck procedure for job-shop scheduling (Q4696979) (← links)
• An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478) (← links)
• A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan (Q5244301) (← links)
• Machine scheduling with transportation considerations (Q5932281) (← links)
• Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (Q5964074) (← links)
• Joint replenishment meets scheduling (Q6102849) (← links)
• An improved memetic algorithm for integrated production scheduling and vehicle routing decisions (Q6109340) (← links)
• Scheduling Algorithms for Single Machine Problem with Release and Delivery Times (Q6110178) (← links)
• Flow shop scheduling problems with transportation constraints revisited (Q6185848) (← links)
• An improved approximation algorithm for a scheduling problem with transporter coordination (Q6204661) (← links)
• Single-machine time-dependent scheduling with proportional and delivery times (Q6542862) (← links)
• An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop (Q6588488) (← links)
• Minimizing the maximum lateness for scheduling with release times and job rejection (Q6646743) (← links)