A Heuristic for Inserting Randomly Arriving Jobs Into an Existing Hoist Schedule.
Pengyu YanAda CheEugene LevnerShi Qiang LiuPublished in: IEEE Trans Autom. Sci. Eng. (2018)
Keyphrases
- scheduling problem
- scheduling decisions
- unrelated parallel machines
- strongly np hard
- parallel machine scheduling problem
- processing times
- open shop
- single machine scheduling problem
- flowshop
- worst case performance ratio
- tabu search
- list scheduling
- cyclic scheduling
- limited capacity
- scheduling jobs
- arrival rate
- single machine
- data streams
- deteriorating jobs
- setup times
- parallel machines
- precedence constraints
- iterative repair
- simulated annealing
- identical parallel machines
- optimal solution
- job shop
- np hard
- production scheduling
- scheduling algorithm
- combinatorial optimization
- minimizing makespan
- critical path
- sequence dependent setup times
- asymptotic optimality
- approximation algorithms
- data sets
- steady state
- search procedure
- release dates
- release times
- scheduling policies
- dynamic programming
- batch processing
- lower bound
- total weighted tardiness