New Properties for Solving the Single-Machine Scheduling Problem with Early/Tardy Jobs.
Hemmak AllaouaBouderah BrahimPublished in: J. Intell. Syst. (2017)
Keyphrases
- single machine scheduling problem
- single machine
- single machine scheduling
- release dates
- weighted tardiness
- processing times
- combinatorial optimization
- earliness tardiness
- scheduling problem
- release times
- branch and bound algorithm
- sequence dependent setup times
- precedence constraints
- total weighted tardiness
- setup times
- completion times
- lower bound
- resource consumption
- minimize total
- parallel machines
- lp relaxation
- flowshop
- linear program
- branch and bound
- simulated annealing
- np hard