Fundamental lemmas for the determination of optimal control strategies for a class of single machine family scheduling problems.
Davide GiglioPublished in: CoRR (2015)
Keyphrases
- single machine
- scheduling problem
- control strategies
- competitive ratio
- processing times
- earliness tardiness
- maximum lateness
- dynamic programming
- total weighted tardiness
- total tardiness
- control strategy
- np hard
- release times
- release dates
- minimize total
- control system
- precedence constraints
- flowshop
- weighted tardiness
- sequence dependent setup times
- job shop scheduling
- setup times
- production scheduling
- scheduling jobs
- parallel machines
- reinforcement learning
- single machine scheduling problem
- tabu search
- special case
- genetic algorithm
- deteriorating jobs
- neural network
- strongly np hard
- job shop
- mathematical models
- worst case
- optimal solution
- job shop scheduling problem
- weighted number of tardy jobs
- number of late jobs
- identical machines
- mathematical model
- real time