Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯

DOI10.1145/321864.321872MaRDI QIDQ4072835zbMATH OpenOpenAlexFDO

Authors Walter Köhler, Ken Steiglitz

Publication date 1975

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321864.321872

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Algorithms in computer science (68W99)

Cited in

(13)

• Using branch-and-bound algorithms to obtain suboptimal solutions
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
• The two-machine total completion time flow shop problem
• A comparison of local search methods for flow shop scheduling
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times
• A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime
• Two- and three-machine flow shop scheduling problems with equal sized transfer batches
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• A two-machine flowshop problem with two agents
• Lower bounds for minimizing total completion time in a two-machine flow shop
• A bicriteria flowshop scheduling with a learning effect
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
• scientific article; zbMATH DE number 502872 (Why is no real title available?)

This page was built for publication: Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯

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