Mathematical programming models for optimizing partial-order plan flexibility

DOI10.3233/978-1-61499-672-9-1044zbMATH Open1403.68245OpenAlexW2576812460MaRDI QIDQ4576235FDOQ4576235

Authors: Buser Say, Andre A. Cire, J. Christopher Beck 

Publication date: 12 July 2018

Full work available at URL: https://doi.org/10.3233/978-1-61499-672-9-1044

Recommendations

• 0-1 mathematical programming models for flexible process planning
• scientific article; zbMATH DE number 2084779
• Mathematical models for job-shop scheduling problems with routing and process plan flexibility
• Integration of mathematical programming with constraint programming for multi-objective planning and scheduling
• scientific article; zbMATH DE number 2084756
• Exact solution procedures for certain planning problems in flexible manufacturing systems
• Models and algorithms for planning and scheduling problems
• Mathematical programming approach to the optimality of the solution for deterministic inventory models with partial backordering

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mixed integer programming (90C11)

Cited In (4)

• Title not available (Why is that?)
• An integrated mathematical programming model for offset planning.
• Optimal partial-order plan relaxation via MaxSAT
• Partial-order planning: Evaluating possible efficiency gains

This page was built for publication: Mathematical programming models for optimizing partial-order plan flexibility

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