Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost.
Akiyoshi ShiouraNatalia V. ShakhlevichVitaly A. StrusevichPublished in: J. Glob. Optim. (2020)
Keyphrases
- scheduling problem
- single machine
- job processing times
- tardiness cost
- processing times
- completion times
- release dates
- sequence dependent setup times
- flowshop
- image compression
- compression algorithm
- high cost
- total cost
- setup times
- data compression
- minimum cost
- response time
- job shop scheduling
- job shop
- np hard
- maximum number
- cost sensitive
- compression ratio
- job shop scheduling problem
- dynamic programming
- search algorithm
- packet transmission