Abstract

Cloud manufacturing is an emerging service-oriented and market-oriented networked manufacturing paradigm. Resource scheduling of cloud manufacturing is different from those of other manufacturing paradigms due to some distinctive characteristics, such as high concurrency of multi-service and multi-task, high heterogeneity and high dynamics of resources, incomplete information of cloud services and user-centric services. These characteristics make the resource scheduling problem of cloud manufacturing more complicated. Efficient resource scheduling and economic benefit are the major concerns of users in cloud manufacturing environment. A novel market-based continuous bidding mechanism is proposed in this paper by applying game theory. In this mechanism, the overall benefit of both the cloud service provider and the cloud service demander is considered as the optimization target. The constraints are the task delivery time and budget. For decomposable tasks, the constraints for each subtask are also considered in resource bidding. Service demanders can bid continuously until the corresponding service is obtained or the bidding constraint is violated. Experiments demonstrate the proposed resource bidding mechanism is efficient in cloud service scheduling and can ensure the cloud manufacturing market is truthful and fair.

Highlights

  • In recent years, with the development of information technology and network technology, the manufacturing paradigm has experienced fundamental changes, from virtual manufacturing [1], agile manufacturing [2] and grid manufacturing [3], to the current cloud manufacturing [4], [5]

  • In the market-oriented cloud manufacturing environment, economic benefit is the focus of all the participants

  • A new fair resource bidding mechanism is proposed in cloud manufacturing

Read more

Summary

INTRODUCTION

With the development of information technology and network technology, the manufacturing paradigm has experienced fundamental changes, from virtual manufacturing [1], agile manufacturing [2] and grid manufacturing [3], to the current cloud manufacturing [4], [5]. The resource scheduling of cloud manufacturing has to satisfy the constraint of the task workflow [20]. In order to allocate resources efficiently in multi-service and multi-task application with incompletely transparent information, a novel truthful and fair resource bidding mechanism for cloud manufacturing is proposed in this paper. In this mechanism, the service providers are required to offer a price honestly and can obtain economic benefit in incompletely transparent information environment. Besides the process constraint is taken into account, the user preference of service demanders and services providers have a great influence on the bidding price. The greater rankk is, the higher the priority of subtaskk is. loadk denotes the workload of subtaskk

BIDDING PRICE OF SUBTASK
PSEUDO CODE OF THE ALGORITHM
28: Remove allocateService from Service
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call