A Genetic Regulatory Network-Based Method for Dynamic Hybrid Flow Shop Scheduling with Uncertain Processing Times
Source abstract
Abstract
The hybrid flow shop is a typical discrete manufacturing system. A novel method is proposed to solve the shop scheduling problem featured with uncertain processing times. The rolling horizon strategy is adopted to evaluate the difference between a predictive plan and the actual production process in terms of job delivery time. The genetic regulatory network-based rescheduling algorithm revises the remaining plan if the difference is beyond a specific tolerance. In this algorithm, decision variables within the rolling horizon are represented by genes in the network. The constraints and certain rescheduling rules are described by regulation equations between genes. The rescheduling solutions are generated from expression procedures of gene states, in which the regulation equations convert some genes to the expressed state and determine decision variable values according to gene states. Based on above representations, the objective of minimizing makespan is realized by optimizing regulatory parameters in regulation equations. The effectiveness of this network-based method over other ones is demonstrated through a series of benchmark tests and an application case collected from a printed circuit board assembly shop.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Scheduling and Optimization Algorithms · Advanced Control Systems Optimization · Assembly Line Balancing Optimization
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
Funding
National Natural Science Foundation of China
References (44)
Show source-provided references
1. Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns10.1007/s00170-008-1577-3 ↗
2. Der Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks10.1016/j.ijpe.2012.05.015 ↗
3. A hybrid electromagnetism-like algorithm for a mixed-model assembly line sequencing problem
4. A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times10.1007/s10845-009-0246-1 ↗
5. Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints10.1016/j.cor.2010.07.007 ↗
6. Sequencing of jobs in some production system10.1016/S0377-2217(99)00224-6 ↗
7. Mixed integer programming for scheduling surface mount technology lines10.1080/00207540110053561 ↗
8. A resource-constrained assembly job shop scheduling problem with Lot Streaming technique10.1016/j.cie.2009.04.002 ↗
9. Fuzzy-metaheuristic methods to solve a hybrid flow shop scheduling problem with pre-assignment10.1080/00207543.2012.754964 ↗
10. Elmaghraby, S.E. (1973). Symposium on the Theory of Scheduling and Its Applications, Springer. [1st ed.].10.1007/978-3-642-80784-8 ↗
11. Integrated Production Planning and Scheduling on Automobile Assembly Lines10.1080/07408170304348 ↗
12. Multi-objective optimization algorithms for flow shop scheduling problem: A review and prospects10.1007/s00170-010-3094-4 ↗
13. Heuristics for scheduling a two-stage hybrid flow shop with parallel batching machines: Application at a hospital sterilisation plant10.1080/00207543.2012.737942 ↗
14. Robust production control policy for a multiple machines and multiple product-types manufacturing system with inventory inaccuracy10.1080/00207543.2014.887864 ↗
15. A review of exact solution methods for the non-preemptive multiprocessor flowshop problem10.1016/j.ejor.2003.12.026 ↗
16. The hybrid flow shop scheduling problem10.1016/j.ejor.2009.09.024 ↗
17. A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers10.1016/j.asoc.2011.05.033 ↗
18. A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan10.1007/s00170-010-2868-z ↗
19. Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage10.1016/j.cor.2014.11.012 ↗
20. A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times10.1007/s10845-009-0373-8 ↗
21. Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints10.1007/s10845-011-0571-z ↗
22. A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling10.1080/00207543.2014.949363 ↗
23. Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems
24. Scheduling a real-world hybrid flow shop with variable processing times using Lagrangian relaxation10.1007/s00170-014-6754-y ↗
25. A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment10.1007/s10845-005-7029-0 ↗
26. Chryssolouris, G. (2006). Manufacturing Systems: Theory and Practice, Springer Science & Business Media. [2nd ed.].
27. Predictable scheduling of a job shop subject to breakdowns10.1109/70.678447 ↗
28. Two-stage hybrid flow shop scheduling with dynamic job arrivals10.1016/j.cor.2011.10.006 ↗
29. Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times10.1080/00207543.2016.1162341 ↗
30. Dynamic scheduling of manufacturing job shops using genetic algorithms10.1023/A:1011253011638 ↗
31. A review of the static stochastic flow-shop scheduling problem10.1080/12460125.2000.9736710 ↗
32. Dispatching rule-based algorithms for a dynamic flexible flow shop scheduling problem with time-dependent process defect rate and quality feedback10.1016/j.procir.2013.05.028 ↗
33. A cluster-based scheduling model using SPT and SA for dynamic hybrid flow shop problems10.1007/s00170-012-4645-7 ↗
34. An approach to real-time flexible scheduling10.1007/BF01328813 ↗
35. A stable reactive approach in dynamic flexible flow shop scheduling with unexpected disruptions: A case study10.1016/j.cie.2016.06.018 ↗
36. A web based tool for dynamic job rotation scheduling using multiple criteria10.1016/j.cirp.2011.03.037 ↗
37. Rolling horizon planning in supply chains: Review, implications and directions for future research10.1080/00207543.2013.775523 ↗
38. Stochastic stability of Markovian switching genetic regulatory networks10.1016/j.physleta.2009.03.017 ↗
39. Modeling and simulation of genetic regulatory systems: A literature review10.1089/10665270252833208 ↗
40. Synchronization of stochastic genetic oscillator networks with time delays and Markovian jumping parameters10.1016/j.neucom.2010.06.006 ↗
41. Coarse-grained reverse engineering of genetic regulatory networks10.1016/S0303-2647(99)00090-8 ↗
42. Shan, R., Zhao, Z.S., Chen, P.F., Liu, W.J., Xiao, S.Y., Hou, Y.H., and Wang, Z. (2016). Network modeling and assessment of ecosystem health by a multi-population swarm optimized neural network ensemble. Appl. Sci., 6.10.3390/app6060175 ↗
43. Quan, G.Z., Zhang, Z.H., Zhang, L., and Liu, Q. (2016). Numerical Descriptions of Hot Flow Behaviors across β Transus for as-Forged Ti–10V–2Fe–3Al Alloy by LHS-SVR and GA-SVR and Improvement in Forming Simulation Accuracy. Appl. Sci., 8.10.3390/app6080210 ↗
44. Qin, W., Zhang, J., and Song, D. (2015). An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time. J. Intell. Manuf.10.1007/s10845-015-1144-3 ↗