arXiv (All)
open access
Strong NP-Hardness and Approximation Algorithm for Weighted Tardiness with Release Dates and Identical Processing Times
We study nonpreemptive scheduling on a single machine with release dates, due dates, positive job weights, and a common processing time. The objective is to minimize total weighted tardiness. Although closely related equal-processing-time problems admit polynomial-time algorithms, the complexity of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Scheduling with Mandatory Breaks: NP-Hardness and an Additive-One Approximation#1119327
- Single-Machine Scheduling with Interval Predictions and Costly Preemption#1109494
- Flow-Based Lattice Surgery Optimization with Runtime T Gate Scheduling#1049491
- Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times#924402
- Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times#920171
Record · ID 1076407
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive