A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages.
Ewa FigielskaPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- scheduling problem
- flowshop
- unrelated parallel machines
- maximum tardiness
- tabu search
- number of tardy jobs
- preventive maintenance
- processing times
- parallel machines
- minimizing makespan
- strongly np hard
- job shop scheduling problem
- maximum lateness
- setup times
- sequence dependent setup times
- single machine
- bicriteria
- resource allocation
- minimizing total tardiness
- makespan minimization
- flowshop scheduling
- precedence constraints
- job shop
- total tardiness
- np hard
- identical parallel machines
- resource consumption
- release dates
- multistage
- dynamic programming
- flowshop scheduling problems
- total weighted tardiness
- permutation flowshop
- simulated annealing
- special case
- job processing times
- heuristic methods
- feasible solution
- search algorithm
- neural network
- branch and bound algorithm
- cost function
- optimal solution