How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions.
Wiebke HöhnJulián MestreAndreas WiesePublished in: ICALP (1) (2014)
Keyphrases
- cost function
- scheduling problem
- job shop
- batch processing
- identical machines
- job scheduling
- identical parallel machines
- scheduling jobs
- deteriorating jobs
- processing times
- release dates
- release times
- single machine
- flowshop
- single machine scheduling problem
- search space reduction
- scheduling algorithm
- maximum lateness
- scheduling decisions
- completion times
- flow patterns
- real time database systems
- batch processing machines
- resource allocation
- round robin
- resource consumption
- resource constraints
- fixed number
- production scheduling
- flow field
- information flow
- asymptotic optimality
- precedence constraints
- expected cost
- manufacturing systems
- polynomial time approximation
- constraint satisfaction
- parallel processors
- np hard
- image sequences