Order Scheduling in an Environment with Dedicated Resources in Parallel
نویسندگان
چکیده
Cj(S): The total completion time of schedule S. Finally, for convenience, for each order constructed from aj (bj , cj), we simply call it order aj (respectively, bj , cj). Also, we assume that the subscripts of the orders in a schedule are labelled in such a way that, aj (bj , or cj) (j = 1, 2, . . . , n): means that there are (j − 1) orders of type a scheduled before aj (respectively, bj , or cj).
منابع مشابه
Improving the palbimm scheduling algorithm for fault tolerance in cloud computing
Cloud computing is the latest technology that involves distributed computation over the Internet. It meets the needs of users through sharing resources and using virtual technology. The workflow user applications refer to a set of tasks to be processed within the cloud environment. Scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...
متن کاملA More Practical Loop Scheduling Scheme for Home-based Software DSMs
Loop scheduling is a critical issue for achieving good performance in parallel and distributed systems. However, this issue is neglected in the area of software DSM systems in the past. All the previous research is based on dedicated homogeneous hardware environment, such as shared memory multiprocessors, and hardware distributed shared memory systems. The main contribution of this paper is two...
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Scheduling
دوره 8 شماره
صفحات -
تاریخ انتشار 2005