An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times

DOI10.1007/978-3-031-22990-9_6zbMath1527.90099MaRDI QIDQ6090764

Unnamed Author

Publication date: 17 November 2023

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsingle machine scheduling problemworst-case performance ratioinserted idle time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
• A branch and bound method for the job-shop problem with sequence-dependent setup times
• A block approach for single-machine scheduling with release dates and due dates
• The one-machine sequencing problem
• An approximation algorithm for a single-machine scheduling problem with release times and delivery times
• Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item

This page was built for publication: An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times