Minimizing the total flow time and the tardiness in a two-machine flow shop.
Wen-Chiung LeeChin-Chia WuPublished in: Int. J. Syst. Sci. (2001)
Keyphrases
- processing times
- completion times
- number of tardy jobs
- scheduling problem
- single machine
- single machine scheduling problem
- absolute deviation
- flowshop
- scheduling jobs
- np hard
- release dates
- parallel machines
- flow patterns
- database
- minimize total
- information flow
- single machine scheduling
- flow field
- dynamic programming
- data sets