LAPSE:2023.4908
Published Article

LAPSE:2023.4908
A New Perspective for Solving Manufacturing Scheduling Based Problems Respecting New Data Considerations
February 23, 2023
Abstract
In order to attain high manufacturing productivity, industry 4.0 merges all the available system and environment data that can empower the enabled-intelligent techniques. The use of data provokes the manufacturing self-awareness, reconfiguring the traditional manufacturing challenges. The current piece of research renders attention to new consideration in the Job Shop Scheduling (JSSP) based problems as a case study. In that field, a great number of previous research papers provided optimization solutions for JSSP, relying on heuristics based algorithms. The current study investigates the main elements of such algorithms to provide a concise anatomy and a review on the previous research papers. Going through the study, a new optimization scope is introduced relying on additional available data of a machine, by which the Flexible Job-Shop Scheduling Problem (FJSP) is converted to a dynamic machine state assignation problem. Deploying two-stages, the study utilizes a combination of discrete Particle Swarm Optimization (PSO) and a selection based algorithm followed by a modified local search algorithm to attain an optimized case solution. The selection based algorithm is imported to beat the ever-growing randomness combined with the increasing number of data-types.
In order to attain high manufacturing productivity, industry 4.0 merges all the available system and environment data that can empower the enabled-intelligent techniques. The use of data provokes the manufacturing self-awareness, reconfiguring the traditional manufacturing challenges. The current piece of research renders attention to new consideration in the Job Shop Scheduling (JSSP) based problems as a case study. In that field, a great number of previous research papers provided optimization solutions for JSSP, relying on heuristics based algorithms. The current study investigates the main elements of such algorithms to provide a concise anatomy and a review on the previous research papers. Going through the study, a new optimization scope is introduced relying on additional available data of a machine, by which the Flexible Job-Shop Scheduling Problem (FJSP) is converted to a dynamic machine state assignation problem. Deploying two-stages, the study utilizes a combination of discrete Particle Swarm Optimization (PSO) and a selection based algorithm followed by a modified local search algorithm to attain an optimized case solution. The selection based algorithm is imported to beat the ever-growing randomness combined with the increasing number of data-types.
Record ID
Keywords
flexible job shop scheduling, heuristics, Industry 4.0, integrated process planning and scheduling, job shop scheduling, Optimization
Subject
Suggested Citation
Awad MA, Abd-Elaziz HM. A New Perspective for Solving Manufacturing Scheduling Based Problems Respecting New Data Considerations. (2023). LAPSE:2023.4908
Author Affiliations
Awad MA: Design and Production Engineering Department, Ain-Shams University, 1 El Sarayat St., ABBASSEYA, Al Waili, Cairo 11517, Egypt
Abd-Elaziz HM: Mechatronics Department, Badr University in Cairo, Cairo-Suez Road, Cairo 11829, Egypt
Abd-Elaziz HM: Mechatronics Department, Badr University in Cairo, Cairo-Suez Road, Cairo 11829, Egypt
Journal Name
Processes
Volume
9
Issue
10
First Page
1700
Year
2021
Publication Date
2021-09-23
ISSN
2227-9717
Version Comments
Original Submission
Other Meta
PII: pr9101700, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2023.4908
This Record
External Link

https://doi.org/10.3390/pr9101700
Publisher Version
Download
Meta
Record Statistics
Record Views
464
Version History
[v1] (Original Submission)
Feb 23, 2023
Verified by curator on
Feb 23, 2023
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2023.4908
Record Owner
Auto Uploader for LAPSE
Links to Related Works
(0.07 seconds)
[0.07 s]
