Two-agent single machine scheduling with forbidden intervals
From MaRDI portal
Publication:902407
DOI10.1007/S11766-015-3076-2zbMATH Open1340.90103OpenAlexW2396458309MaRDI QIDQ902407FDOQ902407
Authors: Qi Feng, Shisheng Li, Weiping 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
Recommendations
- SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
- Single machine scheduling with forbidden start times
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- Two-agent scheduling with rejection on a single machine
- Competitive two-agent scheduling and its applications
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Competitive two-agent scheduling and its applications
- Scheduling Problems with Two Competing Agents
- A note on the scheduling with two families of jobs
- Scheduling with limited machine availability
- Unbounded parallel-batching scheduling with two competitive agents
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Minimizing Total Tardiness on One Machine is NP-Hard
- Current trends in deterministic scheduling
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Two-agent single-machine scheduling with assignable due dates
- 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
- Approximation schemes for two-machine flow shop scheduling with two agents
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- Approximation schemes for two-agent scheduling on parallel machines
Cited In (5)
- SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
- A subset-sum type formulation of a two-agent single-machine scheduling problem
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- High-multiplicity scheduling on one machine with forbidden start and completion times
- Two-agent scheduling with rejection on a single machine
This page was built for publication: Two-agent single machine scheduling with forbidden intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902407)
