Two-person cooperative games on processing jobs with due date

MaRDI QIDQ3175974zbMATH OpenFDO

Authors Ji Jin

Publication date 18 July 2018

zbMATH Keywords

dynamic programming algorithmlinear functionscheduling gamesprofit allocationmaximal tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Cooperative games (91A12) 2-person games (91A05)

Recommendations

• Two-person cooperative games on makespan scheduling
• Maximum latency scheduling problem on two-person cooperative games
• Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date
• Makespan scheduling on two-person cooperative games with position-dependent processing times
• Processing games with restricted capacities

Cited in

(6)

• Two-person cooperative games on makespan scheduling
• Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date
• Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process
• Maximum latency scheduling problem on two-person cooperative games
• Makespan scheduling on two-person cooperative games with position-dependent processing times
• Processing games with shared interest

This page was built for publication: Two-person cooperative games on processing jobs with due date

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