A Study Review of Completion Multi Job on Job Shop Scheduling Technique To Minimize Make Span
Abstract
In this paper, the development of flexibility job shop scheduling problem was many discussed before globally. The concept job shop scheduling had discussion like minimize total make span, throughput approaching, lot streaming, no-wait job shop, and many more. Also, into job shop scheduling always consider deadline or due date for job load into machine available with target at the end how to optimize machine capacity and minimum make span.
References
Aldowaisan, T., & Allahverdi, A. (1998). TOTAL FLOWTIME IN NO-WAIT FLOWSHOPS WITH SEPARATED SETUP TIMES. 25(9).
Alli, A. M., & Ph, D. (1989). Computers ind. Engng. 17, 359–365.
ASchauer2018.pdf. (n.d.).
Benttaleb, M., Hnaien, F., & Yalaoui, F. (2018). Two-machine job shop problem under availability constraints on one machine: Makespan minimization. Computers and Industrial Engineering, 117, 138–151. https://doi.org/10.1016/j.cie.2018.01.028
Deng, G., Zhang, Z., Jiang, T., & Zhang, S. (2019). Total flow time minimization in no-wait job shop using a hybrid discrete group search optimizer. Applied Soft Computing Journal, 81, 105480. https://doi.org/10.1016/j.asoc.2019.05.007
Golmohammadi, D. (2015). A study of scheduling under the theory of constraints. International Journal of Production Economics, 165, 38–50. https://doi.org/10.1016/j.ijpe.2015.03.015
Jatoth2019.pdf. (n.d.).
Kumar, V., & Iyer, A. (2006). Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times. 103, 633–647. https://doi.org/10.1016/j.ijpe.2005.12.004
Lee, G. (2014). Real-time order flowtime estimation methods for two-stage hybrid flowshops. Omega, 42(1), 1–8. https://doi.org/10.1016/j.omega.2013.02.004
Lin, C., & Liao, C. (2004). Makespan minimization subject to owtime optimality on identical parallel machines. 31, 1655–1666. https://doi.org/10.1016/S0305-0548(03)00113-8
Lin, J., Zhu, L., & Wang, Z. J. (2019). A hybrid multi-verse optimization for the fuzzy flexible job-shop scheduling problem. Computers and Industrial Engineering, 127(November), 1089–1100. https://doi.org/10.1016/j.cie.2018.11.046
Mor, B., & Mosheiov, G. (2014). Int . J . Production Economics Batch scheduling with a rate-modifying maintenance activity to minimize total fl owtime. Intern. Journal of Production Economics, 153, 238–242. https://doi.org/10.1016/j.ijpe.2014.03.004
Pontevedra, V., Santana, A., Afonso, P., Zanin, A., & Wernke, R. (2018). ScienceDirect ScienceDirect ScienceDirect ScienceDirect An efficient constructive heuristic to balance trade-offs between An efficient constructive heuristic to balance trade-offs between makespan and flowtime in permutation flow shop scheduling makespan . Procedia Manufacturing, 26, 40–48. https://doi.org/10.1016/j.promfg.2018.07.005
Rajendran, C., & Ziegler, H. (1999). Heuristics for scheduling in ¯ owshops and ¯ owline-based manufacturing cells to minimize the sum of weighted ¯ owtime and weighted tardiness of jobs. 37, 671–690.
Sun, C. H. (2017). Timing of entry and product location in a linear barbell model: Application to flexible manufacturing systems. International Review of Economics and Finance, 52(June), 29–38. https://doi.org/10.1016/j.iref.2017.09.004
Wang, X., & Cheng, T. C. E. (2005). Two-machine owshop scheduling with job class setups to minimize total owtime. 32, 2751–2770. https://doi.org/10.1016/j.cor.2004.04.002
Ye, H., Li, W., & Abedini, A. (2017). An improved heuristic for no-wait flow shop to minimize makespan. Journal of Manufacturing Systems, 44, 273–279. https://doi.org/10.1016/j.jmsy.2017.04.007
Copyright (c) 2020 PROFISIENSI
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
PROFISIENSI uses an exclusive license agreement. The authors will retain copyright along with the rights for academic use, while Universitas Riau Kepulauan will be granted publishing and distribution rights.
Open-access authors retain the copyright of their papers, and all open-access articles are distributed under the terms of the Creative Commons Attribution License (CC-BY), allowing others to distribute and copy the articles as long as the original work is properly cited.
Users cannot represent authors as support for the adaptation of their articles and do not change articles in such a way as to damage the honor or reputation of the author.
