scheduling method
1Linear scheduling method — (LSM) is a graphical scheduling method focusing on continuous resource utilization in repetitive activities. It is believed that it originally adopted the idea of Line Of Balance method.LSM is used mainly in construction industry to schedule… …
2Scheduling algorithm — In computer science, a scheduling algorithm is the method by which threads, processes or data flows are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to load balance a system effectively or …
3Evidence Based Scheduling — (EBS) is a method of scheduling software projects coined by Joel Spolsky [ [http://www.joelonsoftware.com/items/2007/10/26.html Joel On Software Article] ] . EBS looks at the historical track records of every person who enters estimates in a… …
4Critical path method — PERT chart for a project with five milestones (10 through 50) and six activities (A through F). The project has two critical paths: activities B and C, or A, D, and F – giving a minimum project time of 7 months with fast tracking. Activity E is… …
5Crew scheduling — is the process of assigning crews to operate transportation systems, such as rail lines or aircraft. Contents 1 Complex 2 4 Parts 3 Real Time 4 Disruptions …
6Job shop scheduling — For other uses, see Scheduling. Job shop scheduling (or Job shop problem) is an optimization problem in computer science in which ideal jobs are assigned to resources at particular times. The most basic version is as follows: We are given n jobs… …
7Block scheduling — is a type of academic scheduling in which each student has fewer classes per day for a longer period of time. This is intended to result in more time for teaching due to less class switching and preparation. It also allows for a student to take… …
8I/O scheduling — For process scheduling, see scheduling (computing). For process management, see process management (computing). Input/output (I/O) scheduling is a term used to describe the method computer operating systems decide the order that block I/O… …
9Fair-share scheduling — is a scheduling strategy for computer operating systems in which the CPU usage is equally distributed among system users or groups, as opposed to equal distribution among processes. For example, if four users (A,B,C,D) are concurrently executing… …
10Two-level scheduling — is a computer science term to describe a method to more efficiently perform process scheduling that involves swapped out processes. Consider this problem: A system contains 50 running processes all with equal priority. However, the system s… …
