Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
From MaRDI portal
Publication:2341390
DOI10.1007/S10951-013-0360-YzbMath1311.90057OpenAlexW1965635117MaRDI QIDQ2341390
Publication date: 24 April 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0360-y
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (9)
A survey of due-date related single-machine with two-agent scheduling problem ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions ⋮ Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval ⋮ A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
Cites Work
- Preemptive scheduling with two minimax criteria
- A multiple-criterion model for machine scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Some simple scheduling algorithms
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
This page was built for publication: Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
