Application of ELSP solution techniques to the deterministic robotic scheduling problem

DOI10.1080/00207549508904854zbMath0908.90166OpenAlexW2068917549MaRDI QIDQ4399098

Christos P. Koulamas

Publication date: 2 December 1998

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

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

zbMATH Keywords

flexible deterministic robotic scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Cites Work

• Unnamed Item
• Design of tool magazine and operational areas for a multi-tool machine
• On the Feasibility of Scheduling Lot Sizes for Two Products on One Machine
• Feasibility of Scheduling Lot Sizes of Three Products on One Machine
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• A hierarchical approach for metal parts fabrication
• Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems
• A Dynamic Programming Approach to a Lot Size Scheduling Problem

This page was built for publication: Application of ELSP solution techniques to the deterministic robotic scheduling problem