A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
From MaRDI portal
Publication:2668670
Recommendations
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- Scheduling Algorithms for Single Machine Problem with Release and Delivery Times
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Two-agent scheduling on a single machine with release dates
- An improved approximation algorithm for single machine scheduling with job delivery
Cites work
- `` Strong NP-Completeness Results
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- A parallel algorithm of simulated annealing for multiprocessor scheduling
- A survey of scheduling problems with setup times or costs
- An Algorithm for Solving the Job-Shop Problem
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times
- Distributionally robust single machine scheduling with the total tardiness criterion
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 1330032 (Why is no real title available?)
- scientific article; zbMATH DE number 2065615 (Why is no real title available?)
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Literature review on multi-appointment scheduling problems in hospitals
- Minimizing maximum lateness on one machine: computational experience and some applications
- Nurse scheduling with quick-response methods: improving hospital performance, nurse workload, and patient experience
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- Operating room planning and scheduling: a literature review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Parameterized complexity of machine scheduling: 15 open problems
- PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Sequencing with due-dates and early start times to minimize maximum tardiness
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- The design of approximation algorithms
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- The one-machine sequencing problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(6)- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- scientific article; zbMATH DE number 1757946 (Why is no real title available?)
- Delivery scheduling with variable processing times and due date assignments
- Parallel shifting bottleneck algorithms for non-permutation flow shop scheduling
This page was built for publication: A parallel randomized approximation algorithm for non-preemptive single machine scheduling 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 Q2668670)
