An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times.
Ji TianRuyan FuJinjiang YuanPublished in: Inf. Process. Lett. (2011)
Keyphrases
- single machine
- scheduling problem
- competitive ratio
- release dates
- scheduling jobs
- total weighted tardiness
- single machine scheduling problem
- dynamic programming
- np hard
- learning algorithm
- weighted tardiness
- maximum lateness
- release times
- parallel machines
- objective function
- linear programming
- computational complexity
- average case
- processing times
- minimize total
- sequence dependent setup times
- simulated annealing
- production scheduling
- flexible manufacturing systems
- flowshop
- strongly np hard
- identical machines
- worst case
- search space