Parallel Scheduling Subject to Release Dates and Delivery Times Under the Non-idling Constraint.
Fatma HermèsKhaled GhédiraPublished in: ICINCO (Selected Papers) (2017)
Keyphrases
- release dates
- parallel machines
- single machine
- scheduling problem
- minimize total
- processing times
- identical machines
- single machine scheduling problem
- precedence constraints
- sequence dependent setup times
- maximum lateness
- shared memory
- scheduling jobs
- branch and bound algorithm
- identical parallel machines
- global constraints
- holding cost
- approximation algorithms
- genetic algorithm
- constraint satisfaction
- special case