Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs.
S. ThiagarajanChandrasekharan RajendranPublished in: Comput. Ind. Eng. (2005)
Keyphrases
- completion times
- weighted tardiness
- single machine scheduling problem
- single machine
- scheduling problem
- release times
- processing times
- single machine scheduling
- release dates
- minimize total
- flowshop
- sequence dependent setup times
- setup times
- precedence constraints
- total weighted tardiness
- parallel machines
- identical parallel machines
- combinatorial optimization
- branch and bound algorithm
- tabu search
- weighted number of tardy jobs
- identical machines
- lagrangian relaxation
- np hard
- shortest processing time
- resource consumption
- job shop
- genetic algorithm
- dynamic programming
- search space
- search procedure
- partial order
- branch and bound
- evolutionary algorithm
- tardiness cost
- tardiness penalties