An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem

DOI10.1109/T-C.1974.223825zbMath0288.68026MaRDI QIDQ4776845

Marc T. Kaufman

Publication date: 1974

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items

A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations ⋮ Modelling and scheduling a batch-type production on identical machines ⋮ A survey of scheduling methods for multiprocessor systems ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ NP-Complete operations research problems and approximation algorithms ⋮ Approximation scheduling algorithms: a survey