Two-agent single machine scheduling with forbidden intervals

DOI10.1007/S11766-015-3076-2MaRDI QIDQ902407zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dynamic programmingtwo-agent schedulingforbidden interval

Mathematics Subject Classification ID

Dynamic programming (90C39) Stochastic scheduling theory in operations research (90B36)

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

• A multiple-criterion model for machine scheduling
• A note on the scheduling with two families of jobs
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• An investigation on a two-agent single-machine scheduling problem with unequal release dates
• Approximation schemes for two-agent scheduling on parallel machines
• Approximation schemes for two-machine flow shop scheduling with two agents
• Competitive two-agent scheduling and its applications
• Current trends in deterministic scheduling
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Minimizing Total Tardiness on One Machine is NP-Hard
• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Problems with Two Competing Agents
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
• Scheduling with limited machine availability
• Two-agent scheduling with position-based deteriorating jobs and learning effects
• Two-agent single-machine scheduling with assignable due dates
• Unbounded parallel-batching scheduling with two competitive agents

Cited in

(5)

• Two-agent scheduling with rejection on a single machine
• Single machine unbounded parallel-batch scheduling with forbidden intervals
• High-multiplicity scheduling on one machine with forbidden start and completion times
• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
• A subset-sum type formulation of a two-agent single-machine scheduling problem

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)