A new heuristic for scheduling the two-stage flowshop with additional resources.
Ewa FigielskaPublished in: Comput. Ind. Eng. (2008)
Keyphrases
- scheduling problem
- flowshop
- unrelated parallel machines
- maximum tardiness
- number of tardy jobs
- tabu search
- processing times
- strongly np hard
- minimizing makespan
- resource consumption
- setup times
- preventive maintenance
- sequence dependent setup times
- single machine
- parallel machines
- job shop scheduling problem
- maximum lateness
- minimizing total tardiness
- job shop
- bicriteria
- makespan minimization
- flowshop scheduling
- special case
- resource constraints
- np hard
- release dates
- precedence constraints
- total tardiness
- resource allocation
- total weighted tardiness
- job processing times
- optimal solution
- single machine scheduling problem
- feasible solution
- metaheuristic
- solution quality
- flowshop scheduling problems
- completion times
- identical parallel machines
- computational complexity
- search algorithm