Two-step approach for scheduling jobs to non-related parallel machines with sequence dependent setup times applying job splitting.
Carlos Eduardo Nogueira BastosLeandro Colombi ResendoPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- scheduling jobs
- parallel machines
- sequence dependent setup times
- single machine
- release dates
- scheduling problem
- processing times
- precedence constraints
- single machine scheduling problem
- flowshop
- setup times
- parallel computing
- identical parallel machines
- single server
- shared memory
- lot sizing
- special case
- lower bound
- utility function