Scheduling jobs with mixed processing times, arbitrary precedence constraints and maximum cost criterion.
Marek DebczynskiStanislaw GawiejnowiczPublished in: Comput. Ind. Eng. (2013)
Keyphrases
- processing times
- scheduling jobs
- precedence constraints
- scheduling problem
- precedence relations
- release dates
- single machine
- parallel machines
- single machine scheduling problem
- setup times
- flowshop
- sequence dependent setup times
- identical parallel machines
- identical machines
- resource consumption
- np hard
- release times
- competitive ratio
- total cost
- branch and bound algorithm
- tabu search
- completion times
- expected cost
- genetic algorithm