Using real-time information to reschedule jobs in a flowshop with variable processing times.
Jose M. FramiñanVictor Fernandez-ViagasPaz Perez-GonzalezPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- processing times
- flowshop
- scheduling problem
- single machine
- number of tardy jobs
- setup times
- single machine scheduling problem
- bicriteria
- special case
- tabu search
- makespan minimization
- total weighted tardiness
- scheduling jobs
- total tardiness
- release dates
- polynomially solvable
- precedence relations
- sequence dependent setup times
- release times
- minimizing makespan
- earliness tardiness
- identical parallel machines
- neural network
- resource consumption
- parallel machines
- search algorithm