Discrete-continuous Scheduling to Minimize the Makespan for Power Processing Rates of Jobs.
Joanna JózefowskaMarek MikaRafal RózyckiGrzegorz WaligóraJan WeglarzPublished in: Discret. Appl. Math. (1999)
Keyphrases
- batch processing
- job scheduling
- discrete space
- identical parallel machines
- parallel machines
- scheduling problem
- processing times
- identical machines
- real time
- unrelated parallel machines
- scheduling strategy
- continuous domains
- scheduling jobs
- continuous data
- optimal scheduling
- release times
- discrete data
- release dates
- continuous space
- continuous functions
- power consumption
- maximum lateness
- wafer fabrication
- computational grids
- continuous action
- precedence relations
- weighted tardiness
- deteriorating jobs
- minimize total
- data processing
- resource allocation
- computational power
- discrete variables
- scheduling algorithm
- continuous valued
- single machine scheduling problem
- precedence constraints
- continuous variables
- piecewise linear
- flowshop
- single machine
- lower bound
- setup times
- flexible manufacturing systems
- continuous state spaces