arXiv (OAI Expanded)
open access
Asymmetric Weighted Earliness-Tardiness: Scheduling with a Nonrestrictive Common Due Date
68q2590c27combinatoricscomputational-complexitydiscrete-mathematicsg-2-1optimization-and-controlprimary
Single-machine asymmetric weighted earliness--tardiness (AWET) scheduling asks how to sequence jobs around a common synchronization date when early and late completion incur unrelated job-dependent penalties. At the boundary nonrestrictive date $d=\sum_jp_j$, a compact V-shaped schedule reduces the
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
- Serial-batch scheduling to minimise the total weighted late work#1011753
- A comparative analysis between the Navy Standard Workweek and the actual work/rest patterns of sailors aboard U.S. Navy frigates#1085103
- Finite Quotients of Right-angled Artin Groups#1036334
- When Does Scale-Invariant Optimization Become Unstable? An Exact Schedule Law with Weight Decay#668026
- 16 U.S.C. § 833d — Rate schedules; preparation, approval, and uniformity#569468
Record · ID 1110439
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