Scheduling with job-rejection and position-dependent processing times on proportionate flowshops.
Alessandro AgnetisGur MosheiovPublished in: Optim. Lett. (2017)
Keyphrases
- processing times
- scheduling problem
- identical machines
- identical parallel machines
- scheduling jobs
- total weighted tardiness
- release dates
- single machine
- flowshop
- number of tardy jobs
- precedence relations
- release times
- minimizing makespan
- setup times
- single machine scheduling problem
- scheduling decisions
- completion times
- makespan minimization
- dispatching rule
- resource consumption
- job processing times
- worst case performance ratio
- sequence dependent setup times
- communication delays
- polynomially solvable
- manufacturing cell
- precedence constraints
- job shop
- parallel machines
- np hard
- special case
- competitive ratio
- job shop scheduling
- tabu search
- strongly np hard
- production scheduling
- job shop scheduling problem
- resource allocation
- particle swarm optimization
- evolutionary algorithm
- shortest processing time