Two-agent single machine scheduling problem with the total weighted early work

DOI10.11721/CQNUJ20210105MaRDI QIDQ3381063zbMATH OpenFDO

Authors Zhang Xingong, Ping Li

Publication date 29 September 2021

Full work available at URL https://doi.org/10.11721/CQNUJ20210105

zbMATH Keywords

schedulingtotal weighted early worktwo-agent

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• Two-agent scheduling problem about total late work on a single machine
• A note on a two-agent scheduling problem related to the total weighted late work
• Single machine scheduling problem with minimize total weighted early work
• scientific article; zbMATH DE number 6531341

Cited in

(10)

• A two-agent single-machine scheduling problem with late work criteria
• 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
• Two competitive agents to minimize the weighted total late work and the total completion time
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• Scheduling with two competing agents to minimize total weighted earliness
• A note on a two-agent scheduling problem related to the total weighted late work
• A single machine scheduling problem to minimize total early work
• Single machine scheduling problem with minimize total weighted early work
• Two-agent scheduling problem about total late work on a single machine

This page was built for publication: Two-agent single machine scheduling problem with the total weighted early work

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