Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date
From MaRDI portal
Publication:1659271
DOI10.1155/2017/7150637OpenAlexW2604336683WikidataQ59146898 ScholiaQ59146898MaRDI QIDQ1659271
Publication date: 15 August 2018
Published in: Journal of Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/7150637
Cooperative games (91A12) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Flowshop scheduling with a general exponential learning effect
- Maximum latency scheduling problem on two-person cooperative games
- Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process
- Single-machine scheduling with learning considerations
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- Bidirectional nonnegative deep model and its optimization in learning
- Multiple-machine scheduling with learning effects and cooperative games
- Scheduling problems with position dependent job processing times: computational complexity results
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
- Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity
- Single-machine group scheduling problems with deteriorating and learning effect
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
- Scheduling jobs under an aging effect
- Single machine scheduling with learning effect considerations
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date