Flexible flowline scheduling problem with constraints for the beginning and terminating time of processing of jobs at stages.
Sheida GohariNasser SalmasiPublished in: Int. J. Comput. Integr. Manuf. (2015)
Keyphrases
- scheduling problem
- setup times
- flowshop
- manufacturing cell
- precedence constraints
- processing times
- single machine
- minimizing makespan
- permutation flowshop
- total tardiness
- earliness tardiness
- parallel machines
- unrelated parallel machines
- sequence dependent setup times
- lot sizing
- identical parallel machines
- maximum lateness
- real time
- single machine scheduling problem
- release dates
- multistage
- total weighted tardiness
- identical machines
- completion times
- parallel machine scheduling problem
- strongly np hard
- special case
- bicriteria
- tabu search
- data processing
- limited capacity
- job shop scheduling problem
- constraint programming
- np hard
- multi item
- job shop
- batch processing