Quadratic assignment problem mathematical modelling for process planning
@article{Azab2016QuadraticAP,
title={Quadratic assignment problem mathematical modelling for process planning},
author={Ahmed E. Azab},
journal={International Journal of Computer Integrated Manufacturing},
year={2016},
volume={29},
pages={561 - 580},
url={https://api.semanticscholar.org/CorpusID:37782062}
}The proposed model cures the conceptual flaws in the classical solutions of the Traveling Salesperson Problem (TSP) and overcomes the complexity of the sub-tour elimination constraints and, for the first time, mathematically formulates precedence constraints, which is a cornerstone of the process planning problem.
3 Citations
Network-based integer programming models for flexible process planning
- 2023
Engineering, Computer Science
In this article, the FPP problem is exactly and concisely formulated as linear integer programming models based on the topology of the AND/OR-network under two criteria: production cost minimisation and completion time minimisation.
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- 2017
Mathematics, Computer Science
A branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex, is presented, which can be easily solved by any effective linear programs algorithms.
0-1 Mathematical Programming Models for Flexible Process Planning
- 2023
Mathematics, Engineering
50 References
Integration of process planning and job shop scheduling with stochastic processing time
- 2013
Engineering, Computer Science
Stochastic parameters are considered and a new approach to adjust to the real-world industry situations is presented and indicates that stochastic results are more robust than those of deterministic in different situations.
Mathematical Modeling for Reconfigurable Process Planning
- 2007
Engineering, Mathematics
Reconfiguring Process Plans: A New Approach to Minimize Change
- 2009
Engineering
A novel process planning concept and a new mathematical programming model have been developed to genuinely reconfigure process plans to optimize the scope, extent and cost of reconfiguration and to overcome the complexity and flaws of existing models.
AND/OR precedence constraint traveling salesman problem and its application to assembly schedule generation
- 1990
Engineering
An AND/OR precedence constraints problem is formulated as a state-constrained traveling salesman problem (SCTSP) and applied to the assembly scheduling problem to reduce the complexity of solving the ordering problem for both the acquisition and generator procedures.
Optimal Operation Grouping and Sequencing Technique for Multistage Machining Systems
- 1995
Engineering, Computer Science
A method incorporating a combination of the expert system and mathematical programming is proposed to produce an optimal operation sequence minimizing the noncutting time and the advantage and effectiveness of the proposed approach are verified.
A Branch and Bound Algorithm Based Process-Planning System for Plastic Injection Mould Bases
- 2001
Engineering, Computer Science
The use of artificial intelligence in the process planning of plastic injection mould bases will allow users to optimise process plans easily for any given mould base, with options to suit dynamic changes on the manufacturing shop floor.
Optimal operation planning and sequencing: minimization of tool changeovers
- 1993
Engineering
Abstract Process planning is divided into two major tasks: routeing planning and operation planning. For operation planning a two-phase problem solving structure is proposed. In phase I, we focus on…
Operation sequencing in CAPP using genetic algorithms
- 1999
Computer Science, Engineering
This paper demonstrates the application of genetic algorithms as a global search technique for a quick identification of optimal or near optimal operation sequences in a dynamic planning environment.
Operation sequencing and machining economics
- 1993
Engineering, Economics
Solution techniques for the combined machining economics-operations sequencing problem are proposed. We examine the problem of determining the sequence and the cutting speeds for a number of…