articleTop 10% cited

Parallel Sequencing and Assembly Line Problems

Operations Research · 1961 · Vol. 9(6) · pp. 841–848

T. C. Hu✉(IBM (United States))

Abstract

This paper deals with a new sequencing problem in which n jobs with ordering restrictions have to be done by men of equal ability. Assume every man can do any of the n jobs. The two questions considered in this paper are (1) How to arrange a schedule that requires the minimum number of men so that all jobs are completed within a prescribed time T, and (2) if m men are available, arrange a schedule that completes all jobs at the earliest time.

Assembly Line Balancing Optimization Scheduling and Optimization Algorithms Advanced Manufacturing and Logistics OptimizationScheduleComputer scienceAssembly lineOperations researchSequence (biology)Line (geometry)Mathematical optimizationOperations managementMathematicsEconomics

Citations

890

FWCI

5.90

field-weighted impact

References

Percentile

94%

vs. same field & year

Citations per year

Cited by