Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem.
Laura BarbulescuAdele E. HoweL. Darrell WhitleyMark RobertsPublished in: ICAPS (2004)
Keyphrases
- scheduling problem
- single machine
- np hard
- flowshop
- tabu search
- job shop
- processing times
- setup times
- precedence constraints
- resource management
- electronic commerce
- earliness tardiness
- minimizing makespan
- total tardiness
- parallel machines
- job shop scheduling problem
- total weighted tardiness
- limited capacity
- resource allocation
- release dates
- sequence dependent setup times
- web resources
- special case
- single machine scheduling problem
- resource constraints
- permutation flowshop
- information resources