How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions.
Wiebke HöhnJulián MestreAndreas WiesePublished in: Algorithmica (2018)
Keyphrases
- cost function
- identical parallel machines
- scheduling problem
- job scheduling
- job shop
- batch processing
- identical machines
- release dates
- scheduling jobs
- maximum lateness
- processing times
- deteriorating jobs
- release times
- single machine
- search space reduction
- flowshop
- flow patterns
- batch processing machines
- single machine scheduling problem
- scheduling algorithm
- fixed number
- scheduling decisions
- information flow
- resource constraints
- flow field
- completion times
- precedence constraints
- parallel machines
- shortest processing time
- limited capacity
- flexible manufacturing systems
- round robin
- resource allocation
- differentiated services
- strongly np hard
- sequence dependent setup times
- resource consumption
- expected cost