scientific article; zbMATH DE number 6531341

DOI10.15960/J.CNKI.ISSN.1007-6093.2015.02.006MaRDI QIDQ3462919zbMATH OpenFDO

Authors Long Wan

Publication date 15 January 2016

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2015.02.006

zbMATH Keywords

algorithm complexityoptimal algorithmtwo-agent scheduling

Mathematics Subject Classification ID

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

Recommendations

• A note on the complexity of the problem of two-agent scheduling on a single machine
• Two-agent single-machine scheduling problem with just-in-time jobs
• A single-machine bi-criterion scheduling problem with two agents
• Two-agent scheduling on a single sequential and compatible batching machine
• Two-agent scheduling on a single machine with release dates
• Two-agent scheduling with rejection on a single machine
• A subset-sum type formulation of a two-agent single-machine scheduling problem
• Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work

Cited in

(25)

• Complexities of four problems on two-agent scheduling
• A two-agent single-machine scheduling problem to minimize the total cost with release dates
• A two-agent single-machine scheduling problem with late work criteria
• Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
• A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms
• Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
• Complexities of some problems on multi-agent scheduling on a single machine
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
• Online single-machine scheduling to minimize the linear combination of makespans of two agents
• Two-agent single-machine scheduling problem with just-in-time jobs
• A subset-sum type formulation of a two-agent single-machine scheduling problem
• The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
• Two-agent scheduling with rejection on a single machine
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A note on a two-agent scheduling problem related to the total weighted late work
• Two-agent single machine scheduling problem with the total weighted early work
• Single machine scheduling problem with two synergetic agents and piece-rate maintenance
• Two-agent scheduling to minimize the total cost
• Single machine just‐in‐time scheduling problems with two competing agents
• A single-machine bi-criterion scheduling problem with two agents
• Two-machine and two-agent flow shop with special processing times structures
• A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem
• Improved algorithms for two single machine scheduling problems
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462919)