Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources.
Jacques CarlierAziz MoukrimAbderrahim SahliPublished in: Discret. Appl. Math. (2018)
Keyphrases
- scheduling problem
- lower bound
- np hard
- upper bound
- resource consumption
- limited capacity
- single machine
- processing times
- strongly np hard
- limited resources
- production planning and scheduling
- worst case
- flowshop
- randomly generated test problems
- preventive maintenance
- tabu search
- branch and bound algorithm
- objective function
- permutation flowshop
- setup times
- production scheduling
- production system
- event detection
- resource allocation
- minimizing makespan
- production planning
- news articles
- sequence dependent setup times
- resource management
- dynamic programming
- manufacturing systems
- wireless sensor networks
- special case
- data structure