Scheduling in dial-indexed production lines

DOI10.1080/0020754031000106461zbMath1052.90555OpenAlexW2092500403MaRDI QIDQ4474678

Emanuela Guerriero, Antonio Grieco, Alfredo Anglani, Tullio Tolio, Roberto Musmanno

Publication date: 12 July 2004

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020754031000106461

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Uses Software

• CPLEX

Cites Work

• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Branch and bound algorithm for the flow shop with multiple processors
• One-dimensional machine location problems in a multi-product flowline with equidistant locations
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Reducing work-in-process movement for multiple products in one-dimensional layout problems

This page was built for publication: Scheduling in dial-indexed production lines