Abstract
Job Shop Scheduling Problem (JSSP) and its relatives; Flexible Job Shop Problem (FJSP) and Dynamic Job Shop Problem (DJSP) used to be discussed separately isolated from process planning data given by CAD/CAM file. However, both the job shop scheduling and process planning are interdependent problems. Moreover, the new smart manufacturing systems requires more awareness between the available job floor data and machine availability. From that perspective, the integrated Job shop - process planning gained new scale of attention in recent studies to cope with smart factories. Within the used techniques phase, Evolution based algorithms proven to be a good solution for each separate problem, developing the same belief for the integration process. The evolution based better described as Non-deterministic Polynomial (NP) hard problems. The current study trying to overcome the obstacles in using such techniques respecting to manufacturing dynamic environment represented in machine-tool wearing.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
