Single machine scheduling
- Single machine scheduling
Single machine scheduling or single resource scheduling is the process of assigning a group of tasks to a single machine or resource. The tasks are arranged so that one or many performance measures may be optimized.
Performance Measures
The performance measures of the tasks in the single machine scheduling problem include:
*Tardiness -
*Earliness -
*Lateness -
*Flowtime -
olution Techniques
Many solution techniques have been applied to solving single machine scheduling problems. Some of the are listed below.
Heuristics
*Shortest Processing Time (SPT):The SPT schedule is optimal if the objective is to minimize the average flowtime.
*Earliest Due Date (EDD):The EDD schedule is optimal if the objective is to minimize the maximum lateness.el dib
Computational
*Genetic Algorithms
*Neural Networks
Wikimedia Foundation.
2010.
Look at other dictionaries:
Scheduling — Unter Scheduling (englisch für „Zeitplanerstellung“), auch Zeitablaufsteuerung genannt, versteht man die Erstellung eines Ablaufplanes (schedule), der Prozessen zeitlich begrenzt Ressourcen zuweist (Allokation). Scheduling findet hauptsächlich in … Deutsch Wikipedia
Single Minute Exchange of Die — (SMED) is one of the many lean production methods for reducing waste in a manufacturing process. It provides a rapid and efficient way of converting a manufacturing process from running the current product to running the next product. This rapid… … Wikipedia
machine tool — machine tooled, adj. a power operated machine, as a lathe, used for general cutting and shaping of metal and other substances. [1860 65] * * * Stationary, power driven machine used to cut, shape, or form materials such as metal and wood. Machine… … Universalium
Single-Minute Exchange of Die — (SMED) is one of the many lean production methods for reducing waste in a manufacturing process. It provides a rapid and efficient way of converting a manufacturing process from running the current product to running the next product. This rapid… … Wikipedia
Notation for theoretic scheduling problems — A convenient notation for theoretic scheduling problems was introduced by Ronald Graham, Eugene Lawler, Jan Karel Lenstra and Alexander Rinnooy Kan. It consists of three fields: α, β and γ. Each field may be a comma separated list of words. The α … Wikipedia
Economic Lot Scheduling Problem — The Economic Lot Scheduling Problem (ELSP) is a problem in economics that has been studied by a large number of researchers for almost 50 years. The term was first used in 1958 by research professor Jack Rogers, who developed a computational… … Wikipedia
Job 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… … Wikipedia
Clock-face scheduling — A clock face schedule is a timetable, where public means of transport run in consistent intervals. The number of departures per time is the frequency of the service. Its name comes from the fact that departures are usually the same number of… … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Memetic algorithm — Memetic algorithms (MA) represent one of the recent growing areas of research in evolutionary computation. The term MA is now widely used as a synergy of evolutionary or any population based approach with separate individual learning or local… … Wikipedia
