Finite capacity scheduling using a predetermined placement sequence

DOI10.1080/0020754031000090603MaRDI QIDQ4474665zbMATH OpenOpenAlexFDO

Authors

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/0020754031000090603

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Finite capacity scheduling—packed placement sequence schedule
• Finite capacity scheduling with the placement sequence method, specification for a computer program
• Finite capacity scheduling with mixed duration tooling trees
• Finite-capacity scheduling-based planning for revenue-based capacity management
• Capacity-filtering algorithms for finite-capacity planning of a flexible flow line

Cited in

(5)

• Heuristic factory planning algorithm for advanced planning and scheduling
• Finite-capacity scheduling-based planning for revenue-based capacity management
• Finite capacity scheduling—packed placement sequence schedule
• Finite capacity scheduling with the placement sequence method, specification for a computer program
• Finite capacity scheduling with mixed duration tooling trees

This page was built for publication: Finite capacity scheduling using a predetermined placement sequence

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