Sequencing jobs that require common resources on a single machine: A solvable case of the TSP.
Jack A. A. van der VeenGerhard J. WoegingerShuzhong ZhangPublished in: Math. Program. (1998)
Keyphrases
- single machine
- processing times
- scheduling problem
- release times
- earliness tardiness
- total tardiness
- total weighted tardiness
- release dates
- maximum lateness
- minimize total
- scheduling jobs
- np hard
- weighted tardiness
- weighted number of tardy jobs
- number of late jobs
- single machine scheduling problem
- sequence dependent setup times
- setup times
- polynomially solvable
- number of tardy jobs
- resource consumption
- deteriorating jobs
- flowshop
- parallel machines
- identical machines
- learning effect
- special case
- completion times
- dynamic programming
- precedence constraints
- np complete
- traveling salesman problem
- lagrangian relaxation
- tabu search
- job processing times
- competitive ratio
- optimal solution
- identical parallel machines
- search space
- genetic algorithm
- strongly np hard
- ant colony optimization
- minimizing makespan
- shortest processing time