Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines.
Michael L. PinedoGideon WeissPublished in: Oper. Res. (1985)
Keyphrases
- precedence constraints
- scheduling jobs
- parallel machines
- processing times
- scheduling problem
- single machine
- flowshop
- release dates
- setup times
- sequence dependent setup times
- makespan minimization
- single machine scheduling problem
- np hard
- polynomially solvable
- identical machines
- identical parallel machines
- release times
- tabu search
- resource consumption
- single server
- parallel computing
- competitive ratio
- particle swarm optimization
- lower bound
- optimal solution