Development of a Simplified Mathematical Modelling for the Job Shop Scheduling to Calculate Makespan
DOI:
https://doi.org/10.37591/joprm.v7i1.3723Keywords:
Job-Shop Scheduling, Mathematical modeling, Gantt chart, MakspanAbstract
In this paper, mathematical modelling is prepared for job shop scheduling problem. Makespan is calculated using maximum machine time. Matlab algorithm is developed for mathematical modelling. Formula is tested using various case studies. Gantt chart is prepared for graphical representation of solution. Results have been verified for mathematical modelling using Gantt chart approach.
Cite this Article
Kagthara MS, Bhatt MG. Development of a Simplified Mathematical Modelling for the Job Shop Scheduling to Calculate Makespan. Journal of Production Research and Management. 2017; 7(1): 22–25p.
References
Keesari HS, Rao RV. Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm. Opsearch. 2014; 51(4): 545–561p.
Guo ZX, et al. Mathematical model and genetic optimization for the job shop scheduling problem in a mixed-and multi-product assembly environment: a case study based on the apparel industry. Comput Ind Eng. 2006; 50(3): 202–219p.
Šeda Miloš. Mathematical models of flow shop and job shop scheduling problems. World Acad Sci Eng Technol. 2007; 1(31): 122–127p.
Moghaddas R, Houshm M. Job-shop scheduling problem with sequence dependent setup times. Proceedings of the International Multi Conference of Engineers and Computer Scientists, 2008.
Mahavi Mazdeh, Mohammad Farzad Zaerpour, Farzad Firouzi Jahantigh. A fuzzy modeling for single machine scheduling problem with deteriorating jobs. Int J Ind Eng Comput. 2010; 1(2): 147–156p.
Shapiro JF. Mathematical programming models and methods for production planning and scheduling, in: S.C. Graves, et al. (Eds.), Handbooks in OR and MS, vol. 4, Elsevier Science Publishers B.V., 1993, 371–443p.
Pan, Chao-Hsien. A study of integer Mathematical Modelling for the Job Shop Scheduling programming formulations for scheduling problems. Int J Syst Sci. 1997; 28(1): 33–41p.
Blazewicz, Jacek, Moshe Dror, Jan Weglarz. Mathematical programming formulations for machine scheduling: a survey. Eur J Oper Res. 1991; 51(3): 283–300p.
Bowman EH. The scheduling-sequence problem. Oper Res. 1959; 7(5): 621–4p.
Dantzig GB. A machine-job scheduling model. Manage Sci. 1959; 6: 191–6p.
Downloads
Published
Issue
Section
License
Declaration and Copyright Transfer Form
(to be completed by authors)
I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
- I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
- I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
- I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
- I/We also agree to the authorship of the article in the following order:
Author’s name
1. ________________
2. ________________
3. ________________
4. ________________
| We Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal. |