An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times
From MaRDI portal
Publication:6090764
DOI10.1007/978-3-031-22990-9_6zbMATH Open1527.90099MaRDI QIDQ6090764FDOQ6090764
Authors:
Publication date: 17 November 2023
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Recommendations
- Scheduling Algorithms for Single Machine Problem with Release and Delivery Times
- An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
- Preemptive scheduling with release dates, delivery times and sequence independent setup times
- An improved approximation algorithm for single machine scheduling with job delivery
- Single machine scheduling with release dates and job delivery to minimize the makespan
approximation algorithmworst-case performance ratiosingle machine scheduling probleminserted idle time
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The one-machine sequencing problem
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
- A block approach for single-machine scheduling with release dates and due dates
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
This page was built for publication: An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090764)