Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications.
Ali AllahverdiFawaz S. Al-AnziPublished in: Comput. Oper. Res. (2002)
Keyphrases
- flowshop
- scheduling problem
- maximum lateness
- single machine
- sequence dependent setup times
- parallel machine scheduling problem
- processing times
- data objects
- multimedia
- tabu search
- parallel machines
- total tardiness
- np hard
- setup times
- bicriteria
- flowshop scheduling
- minimizing makespan
- minimizing total tardiness
- release dates
- lot sizing
- dynamic programming
- special case
- preventive maintenance
- precedence constraints
- upper bound
- lower bound