0-1 mathematical programming models for flexible process planning

DOI10.1016/j.ejor.2022.12.030OpenAlexW4313368014MaRDI QIDQ6112702

Kaiping Luo, Guangya Shen, Jianfei Sun, Liheng Li

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.12.030

zbMATH Keywords

flexible manufacturing systemscombinatorial optimizationmathematical programmingprocess planningoperation sequencing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Multi-objective FMS process planning with various flexibilities using a symbiotic evolutionary algorithm
• A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• Makespan minimization with OR-precedence constraints
• Machine scheduling with soft precedence constraints
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• Optimization of process plans using a constraint-based tabu search approach
• Integer Programming Formulation of Traveling Salesman Problems
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: 0-1 mathematical programming models for flexible process planning