An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem

DOI10.1109/T-C.1974.223825MaRDI QIDQ4776845zbMATH OpenFDO

Authors Marc T. Kaufman

Publication date 1974

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

Mathematics Subject Classification ID

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

Cited in

(6)

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

This page was built for publication: An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4776845)