Two-agent single machine scheduling with forbidden intervals
From MaRDI portal
Publication:902407
DOI10.1007/s11766-015-3076-2zbMath1340.90103OpenAlexW2396458309MaRDI QIDQ902407
Qi Feng, Shi-Sheng Li, Wei-Ping Shang
Publication date: 15 January 2016
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-015-3076-2
Cites Work
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A note on the scheduling with two families of jobs
- Current trends in deterministic scheduling
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- Approximation schemes for two-machine flow shop scheduling with two agents
- Approximation schemes for two-agent scheduling on parallel machines
- Scheduling with limited machine availability
- Two-agent single-machine scheduling with assignable due dates
- Unbounded parallel-batching scheduling with two competitive agents
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Two-agent single machine scheduling with forbidden intervals
