Coke production scheduling problem: A parallel machine scheduling with batch preprocessings and location-dependent processing times.
Ming LiuFeng ChuJunkai HeDapeng YangChengbin ChuPublished in: Comput. Oper. Res. (2019)
Keyphrases
- processing times
- scheduling problem
- location dependent
- setup times
- single machine
- mobile environments
- flowshop
- mobile objects
- mobile computing
- production scheduling
- mobile users
- continuous queries
- release dates
- makespan minimization
- np hard
- data retrieval
- batch processing
- total weighted tardiness
- polynomially solvable
- tabu search
- job shop scheduling problem
- resource consumption
- earliness tardiness
- single machine scheduling problem
- completion times
- mobile devices
- precedence constraints
- identical parallel machines
- sequence dependent setup times
- parallel machines
- computing environments
- context aware
- queries involving
- database systems
- data streams
- identical machines
- evolutionary algorithm
- special case
- efficient processing
- location aware
- online algorithms