Movement optimization in flow shop processing with buffers.

DOI10.1007/S001860000044MaRDI QIDQ1403180zbMATH OpenOpenAlexFDO

Authors W. Espelage, Egon Wanke

Publication date 16 October 2003

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001860000044

zbMATH Keywords

Flow shop processing, problem complexity, movement optimization, discrete algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1445308
• Movement minimization for unit distances in conveyor flow shop processing
• scientific article; zbMATH DE number 1834662
• A linear time approximation algorithm for movement minimization in conveyor flow shop processing
• Flow-shop problems with intermediate buffers

Cited in

(3)

• Movement minimization for unit distances in conveyor flow shop processing
• scientific article; zbMATH DE number 1834662 (Why is no real title available?)
• scientific article; zbMATH DE number 1445308 (Why is no real title available?)

This page was built for publication: Movement optimization in flow shop processing with buffers.

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