Construct · 1 fields · 1 citations

Moore-Hodgson algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Production scheduling

single-machine sequencing procedure that minimizes the number of late jobs by repeatedly removing the longest job from a late sequence.

In production scheduling, Moore-Hodgson algorithm refers to single-machine sequencing procedure that minimizes the number of late jobs by repeatedly removing the longest job from a late sequence. This meaning comes from Moore (1968) in Management Science.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Moore-Hodgson algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

number3 fields · 6 citationsjingle · one word, three constructs scheduling3 fields · 7 citationsjingle · one word, three constructs sequence3 fields · 3 citationsjingle · one word, three constructs

References

Moore, J. M. (1968). An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs. Management Science, 15(1), 102-109. https://doi.org/10.1287/mnsc.15.1.102

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct