In operations research, Johnson's rule is a method of scheduling jobs in two work centers. Its primary objective is to find an optimal sequence of jobs to reduce makespan (the total amount of time it takes to complete all jobs). It also reduces the amount of idle time between the two work centers.The method minimizes the makespan in the case of two work centers. Furthermore, the method finds the shortest makespan in the case of three work centers if additional constraints are met.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| - Johnson-Algorithmus (de)
- Regola di Johnson (it)
- Johnson's rule (en)
|
rdfs:comment
| - Der Johnson-Algorithmus ist ein Optimierungsverfahren für Warteschlangen, das 1954 von Selmer M. Johnson vorgestellt wurde. Es findet unter anderem bei der Reihenfolgeplanung zur Bestimmung der minimalen Zykluszeit in der Produktionswirtschaft Anwendung. Der Johnson-Algorithmus liefert eine hinsichtlich der Zykluszeit optimale Reihenfolge von unbestimmt vielen Aufträgen, die jeweils auf genau zwei Maschinen nacheinander bearbeitet werden sollen. Der Algorithmus lässt sich auf mehr als zwei Maschinen verallgemeinern, indem Hilfsprobleme erzeugt werden. (de)
- In operations research, Johnson's rule is a method of scheduling jobs in two work centers. Its primary objective is to find an optimal sequence of jobs to reduce makespan (the total amount of time it takes to complete all jobs). It also reduces the amount of idle time between the two work centers.The method minimizes the makespan in the case of two work centers. Furthermore, the method finds the shortest makespan in the case of three work centers if additional constraints are met. (en)
- La regola di Johnson è un metodo facente parte dell' che si usa quando diverse lavorazioni devono essere eseguite sulle stesse macchine in una sequenza precisa.Per poter trovare l'ordine ottimo in cui realizzare queste lavorazioni occorre conoscere il tempo esatto che impiegherà ogni lavorazione su ogni macchina. (it)
|
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
Link from a Wikipage to an external page
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
has abstract
| - Der Johnson-Algorithmus ist ein Optimierungsverfahren für Warteschlangen, das 1954 von Selmer M. Johnson vorgestellt wurde. Es findet unter anderem bei der Reihenfolgeplanung zur Bestimmung der minimalen Zykluszeit in der Produktionswirtschaft Anwendung. Der Johnson-Algorithmus liefert eine hinsichtlich der Zykluszeit optimale Reihenfolge von unbestimmt vielen Aufträgen, die jeweils auf genau zwei Maschinen nacheinander bearbeitet werden sollen. Der Algorithmus lässt sich auf mehr als zwei Maschinen verallgemeinern, indem Hilfsprobleme erzeugt werden. (de)
- In operations research, Johnson's rule is a method of scheduling jobs in two work centers. Its primary objective is to find an optimal sequence of jobs to reduce makespan (the total amount of time it takes to complete all jobs). It also reduces the amount of idle time between the two work centers.The method minimizes the makespan in the case of two work centers. Furthermore, the method finds the shortest makespan in the case of three work centers if additional constraints are met. (en)
- La regola di Johnson è un metodo facente parte dell' che si usa quando diverse lavorazioni devono essere eseguite sulle stesse macchine in una sequenza precisa.Per poter trovare l'ordine ottimo in cui realizzare queste lavorazioni occorre conoscere il tempo esatto che impiegherà ogni lavorazione su ogni macchina. (it)
|
gold:hypernym
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is rdfs:seeAlso
of | |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage redirect
of | |
is foaf:primaryTopic
of | |