A game-theoretic approach for the web services scheduling problem.
W. FontaniniPaulo A. V. FerreiraPublished in: Expert Syst. Appl. (2014)
Keyphrases
- scheduling problem
- web services
- single machine
- flowshop
- np hard
- processing times
- permutation flowshop
- tabu search
- setup times
- precedence constraints
- web service composition
- web applications
- service providers
- earliness tardiness
- parallel machines
- service composition
- semantic web services
- job shop scheduling problem
- description language
- service oriented
- automatic discovery
- service discovery
- data intensive
- service oriented architecture
- service architecture
- total tardiness
- minimizing makespan
- release dates
- web services composition
- business process
- unrelated parallel machines
- genetic algorithm