Two-agent scheduling problem about total late work on a single machine

DOI10.15960/J.CNKI.ISSN.1007-6093.2017.01.002MaRDI QIDQ5371809zbMATH OpenFDO

Authors Lu Ma, Zhang Xingong

Publication date 20 October 2017

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

zbMATH Keywords

polynomial programming algorithmschedulingtotal late worktwo-agent

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• A two-agent single-machine scheduling problem with late work criteria
• Two-agent single machine scheduling problem with the total weighted early work
• A note on a two-agent scheduling problem related to the total weighted late work
• Two-agent scheduling problem about tardiness on a single machine

Cited in

(9)

• A two-agent single-machine scheduling problem with late work criteria
• Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• A note on a two-agent scheduling problem related to the total weighted late work
• Scheduling with competing agents, total late work and job rejection
• Two-agent single machine scheduling problem with the total weighted early work
• A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
• scientific article; zbMATH DE number 7113489 (Why is no real title available?)
• Two-agent scheduling problem about tardiness on a single machine

This page was built for publication: Two-agent scheduling problem about total late work on a single machine

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