Two-agent scheduling with rejection on a single machine

DOI10.1016/J.APM.2014.07.024MaRDI QIDQ2337544zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximation algorithmsingle machinerejectionagent schedulingpseudo-polynomial-time algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Two-agent parallel-machine scheduling with rejection
• Two-agent single machine scheduling with batch delivery and rejection
• scientific article; zbMATH DE number 6531341
• 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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A multiple-criterion model for machine scheduling
• A note on the complexity of the problem of two-agent scheduling on a single machine
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Competitive two-agent scheduling and its applications
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• Multiprocessor Scheduling with Rejection
• On games corresponding to sequencing situations with ready times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel-machine scheduling with deteriorating jobs and rejection
• Preemptive multiprocessor scheduling with rejection
• Preemptive scheduling with rejection
• Scheduling Problems with Two Competing Agents
• Scheduling linear deteriorating jobs with rejection on a single machine
• Sequencing games
• Single machine scheduling with release dates and rejection
• Single-machine scheduling under the job rejection constraint
• Techniques for scheduling with rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Cited in

(10)

• Two-agent single machine scheduling with batch delivery and rejection
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
• A full polynomial-time approximation scheme of two-agent scheduling with job rejection
• Two-agent single machine scheduling with forbidden intervals
• Two-Agent Scheduling with Resource Augmentation on Multiple Machines
• Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design
• Two-agent parallel-machine scheduling with rejection
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• scientific article; zbMATH DE number 6531341 (Why is no real title available?)
• Scheduling with competing agents, total late work and job 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)