An improved precedence rule for single machine sequencing problems with quadratic penalty.
Sakib A. MondalAnup K. SenPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- single machine
- sequencing problems
- scheduling problem
- precedence constraints
- maximum lateness
- objective function
- processing times
- release dates
- total weighted tardiness
- earliness tardiness
- minimize total
- graph search
- sequence dependent setup times
- learning effect
- scheduling jobs
- release times
- production scheduling
- weighted number of tardy jobs
- np hard
- approximation algorithms
- computational complexity
- single machine scheduling problem
- association rules
- dynamic programming
- lower bound
- job shop scheduling problem
- flowshop
- tabu search
- particle swarm optimization
- deteriorating jobs
- genetic algorithm
- resource constraints
- partial order
- worst case
- search space
- number of late jobs