Constrained scheduling of jobs with different due dates in a flowshop.
Giovanni CelanoAntonio CostaSergio FicheraPublished in: SMC (2) (2002)
Keyphrases
- processing times
- flowshop
- scheduling problem
- number of tardy jobs
- identical parallel machines
- job processing times
- identical machines
- release dates
- single machine
- maximum lateness
- scheduling jobs
- setup times
- sequence dependent setup times
- minimizing total tardiness
- unrelated parallel machines
- preventive maintenance
- parallel machines
- total tardiness
- flowshop scheduling
- precedence constraints
- total weighted tardiness
- makespan minimization
- minimizing makespan
- bicriteria
- single machine scheduling problem
- job shop
- tabu search
- resource consumption
- completion times
- flowshop scheduling problems
- polynomially solvable
- special case
- dispatching rule
- np hard
- permutation flowshop
- total flowtime
- job shop scheduling problem
- open shop
- greedy algorithm
- maximum tardiness
- simulated annealing