Two-agent scheduling with rejection on a single machine
From MaRDI portal
Publication:2337544
DOI10.1016/J.APM.2014.07.024zbMATH Open1432.90054OpenAlexW2094286860MaRDI QIDQ2337544FDOQ2337544
Authors: Qi Feng, Baoqiang Fan, Weiping Shang, Shisheng Li
Publication date: 20 November 2019
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2014.07.024
Recommendations
- Two-agent parallel-machine scheduling with rejection
- Two-agent single machine scheduling with batch delivery and rejection
- scientific article
- A full polynomial-time approximation scheme of two-agent scheduling with job rejection
- Two-agent scheduling on a single sequential and compatible batching machine
- Two-agent scheduling on a single machine with release dates
- Two-agent single machine scheduling with forbidden intervals
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Single machine two-agent scheduling with deteriorating jobs
- Two-agent single-machine scheduling with cumulative deterioration
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Sequencing games
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Techniques for scheduling with rejection
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- Single machine scheduling with release dates and rejection
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Single-machine scheduling under the job rejection constraint
- 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
- Preemptive scheduling with rejection
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multiprocessor Scheduling with Rejection
- Preemptive multiprocessor scheduling with rejection
- Scheduling linear deteriorating jobs with rejection on a single machine
- A note on the complexity of the problem of two-agent scheduling on a single machine
- On games corresponding to sequencing situations with ready times
- Parallel-machine scheduling with deteriorating jobs and rejection
Cited In (10)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Scheduling with competing agents, total late work and job rejection
- Two-agent single machine scheduling with batch delivery and rejection
- A full polynomial-time approximation scheme of two-agent scheduling with job rejection
- Title not available (Why is that?)
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design
- Two-agent single machine scheduling with forbidden intervals
- Two-agent parallel-machine scheduling with rejection
This page was built for publication: Two-agent scheduling with rejection on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337544)