Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
From MaRDI portal
Publication:1853011
DOI10.1016/S0020-0190(01)00274-5zbMath1043.90031OpenAlexW2061019866MaRDI QIDQ1853011
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00274-5
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time ⋮ Approximating Weighted Completion Time for Order Scheduling with Setup Times ⋮ A survey of scheduling problems with setup times or costs ⋮ Preemptive multiprocessor order scheduling to minimize total weighted flowtime
Cites Work
