Buradasınız

A Decomposition Heuristics based on Multi-Bottleneck Machines for Large-Scale Job Shop Scheduling Problems

Journal Name:

Publication Year:

DOI: 
http://dx.doi.org/10.3926/jiem.1206
Abstract (2. Language): 
Purpose: A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems (JSP) is proposed. Design/methodology/approach: In the algorithm, a number of sub-problems are constructed by iteratively decomposing the large-scale JSP according to the process route of each job. And then the solution of the large-scale JSP can be obtained by iteratively solving the sub-problems. In order to improve the sub-problems' solving efficiency and the solution quality, a detection method for multi-bottleneck machines based on critical path is proposed. Therewith the unscheduled operations can be decomposed into bottleneck operations and non-bottleneck operations. According to the principle of “Bottleneck leads the performance of the whole manufacturing system” in TOC (Theory Of Constraints), the bottleneck operations are scheduled by genetic algorithm for high solution quality, and the non-bottleneck operations are scheduled by dispatching rules for the improvement of the solving efficiency. Findings: In the process of the sub-problems' construction, partial operations in the previous scheduled sub-problem are divided into the successive sub-problem for re-optimization. This strategy can improve the solution quality of the algorithm. In the process of solving the sub-problems, the strategy that evaluating the chromosome's fitness by predicting the global scheduling objective value can improve the solution quality. Research limitations/implications: In this research, there are some assumptions which reduce the complexity of the large-scale scheduling problem. They are as follows: The processing route of each job is predetermined, and the processing time of each operation is fixed. There is no machine breakdown, and no preemption of the operations is allowed. The assumptions should be considered if the algorithm is used in the actual job shop. Originality/value: The research provides an efficient scheduling method for the large-scale job shops, and will be helpful for the discrete manufacturing industry for improving the production efficiency and effectiveness.
1397
1414

REFERENCES

References: 

Bassett, M.H., Pekny, J.F., & Reklaitis, G.V. (1996). Decomposition techniques for the solution
of large-scale scheduling problems. AIChE Journal, 42, 3373-3387.
http://dx.doi.org/10.1002/aic.690421209
Braune, R., Zäpfel, G. & Affenzeller, M. (2012). An exact approach for single machine
subproblems in shifting bottleneck procedures for job shops with total weighted tardiness
objective. European Journal of Operational Research, 218, 76-85.
http://dx.doi.org/10.1016/j.ejor.2011.10.020
Chen, H., & Luh, P.B. (2003). An alternative framework to Lagrangian relaxation approach for
job shop scheduling. European Journal of Operational Research, 149, 499-512.
Costas, J., Ponte, B., de la Fuente, D., Pino, R., & Puche, J. (2014). Applying Goldratt’s Theory
of Constraints to reduce the Bullwhip Effect through agent-based modeling. Expert Systems
with Applications, in press. http://dx.doi.org/10.1016/j.eswa.2014.10.022
Dalfard, V.M. & Mohammadi, G. (2012). Two meta-heuristic algorithms for solving multiobjective
flexible job-shop scheduling with parallel machine and maintenance constraints.
Computers & Mathematics with Applications, 64, 2111-2117.
http://dx.doi.org/10.1016/j.camwa.2012.04.007
Feng, X., Leung, H., & Tang, L. (2005). An Effective Algorithm Based on GENET Neural Network
Model for Job Shop Scheduling with Release Dates and Due Dates. Berlin/Heidelberg:
Springer-Verlag. http://dx.doi.org/10.1007/11427391_124
Haoxun, C., Chengbin, C., & Proth, J.M. (1998). An improvement of the Lagrangean relaxation
approach for job shop scheduling: a dynamic programming method. Robotics and
Automation, IEEE Transactions on, 14, 786-795.
Haupt, R. (1989). A Survey of Priority Rule-Based Scheduling. OR Spektrum, 11, 3-16.
http://dx.doi.org/10.1007/BF01721162
Lin, R., & Liao, C.-J. (2012). A case study of batch scheduling for an assembly shop.
International Journal of Production Economics, 139, 473-483.
http://dx.doi.org/10.1016/j.ijpe.2012.05.002
Mönch, L., Schabacker, R., Pabst, D., & Fowler, J.W. (2007). Genetic algorithm-based
subproblem solution procedures for a modified shifting bottleneck heuristic for complex job
shops. European Journal of Operational Research, 177, 2100-2118.
http://dx.doi.org/10.1016/j.ejor.2005.12.020
Pinedo, M.L. (2008). Scheduling: Theory, Algorithms and Systems. New York: Prentice Hall.
Qingdaoerji, R., Wang, Y., & Wang, X. (2013). Inventory based two-objective job shop
scheduling model and its hybrid genetic algorithm. Applied Soft Computing, 13, 1400-1406.
http://dx.doi.org/10.1016/j.asoc.2012.03.073
Scholz-Reiter, B., Hildebrandt, T., & Tan, Y. (2013). Effective and efficient scheduling of
dynamic job shops—Combining the shifting bottleneck procedure with variable neighbourhood
search. CIRP Annals - Manufacturing Technology. http://dx.doi.org/10.1016/j.cirp.2013.03.047
Sourirajan, K. & Uzsoy, R. (2007). Hybrid decomposition heuristics for solving large-scale
scheduling problems in semiconductor wafer fabrication. Journal of Scheduling, 10, 41-65.
http://dx.doi.org/10.1007/s10951-006-0325-5
Wang, L. (2003). Shop scheduling with Genetic Algorithms. Beijing: Tsinghua University Press.
Watson, K.J., Blackstone, J.H., & Gardiner, S.C. (2007). The evolution of a management
philosophy: The theory of constraints. Journal of Operations Management, 25, 387-402.
http://dx.doi.org/10.1016/j.jom.2006.04.004
Zhai, Y., Sun, S., Wang, J., & Niu, G. (2011). Job shop bottleneck detection based on
orthogonal experiment. Computers & Industrial Engineering, 61, 872-880.
http://dx.doi.org/10.1016/j.cie.2011.05.021
Zhang, C.Y., & Li, P., Rao, Y., & Guan, Z. (2008). A very fast TS/SA algorithm for the job shop
scheduling problem. Computers & Operations Research, 35, 282-294.
http://dx.doi.org/10.1016/j.cor.2006.02.024
Zhang, R. & Wu, C. (2010). A hybrid approach to large-scale job shop scheduling. Applied
Intelligence, 32, 47-59. http://dx.doi.org/10.1007/s10489-008-0134-y
Zuo, Y., Gu, H., & Xi, Y. (2008). Study on constraint scheduling algorithm for job shop
problems with multiple constraint machines. International Journal of Production Research, 46,
4785-4801. http://dx.doi.org/10.1080/00207540701324143

Thank you for copying data from http://www.arastirmax.com