Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems.
Danny HermelinJudith-Madeleine KubitzaDvir ShabtayNimrod TalmonGerhard J. WoegingerPublished in: CoRR (2017)
Keyphrases
- single machine
- scheduling problem
- minimize total
- release dates
- maximum lateness
- scheduling jobs
- processing times
- release times
- sequence dependent setup times
- production scheduling
- np hard problems
- rolling horizon
- weighted tardiness
- resource allocation
- parallel machines
- earliness tardiness
- deteriorating jobs
- dynamic programming
- total weighted tardiness
- job shop
- setup times
- resource constraints
- upper bound
- evolutionary algorithm
- weighted number of tardy jobs