JOB-SHOP SCHEDULING OPTIMIZATION WITH STOCHASTIC PROCESSING TIMES
Keywords:JSSP, Genetic Algorithm, Optimization, @Risk
In this study, a job shop scheduling optimization model under risk has been developed to minimize the make span. This model has been built using Microsoft Excel spreadsheets and solved using @Risk solver. A set of experiments have been also conducted to examine the accuracy of the model and its effectiveness has been proven.
S. Goren and I. Sabuncuoglu, "Robustness and stability measures for scheduling: single-machine environment," IIE Transactions, vol. 40, pp. 66-83, 2008. DOI: https://doi.org/10.1080/07408170701283198
Z. Lu, W. Cui, and X. Han, "Integrated production and preventive maintenance scheduling for a single machine with failure uncertainty," Computers & Industrial Engineering, vol. 80, pp. 236- 244, 2015. DOI: https://doi.org/10.1016/j.cie.2014.12.017
M. Singer, "Forecasting policies for scheduling a stochastic due date job shop," International Journal of Production Research, vol. 38, pp. 3623-3637, 2000.
D. Golenko-Ginzburg, S. Kesler, and Z. Landsman, "Industrial job-shop scheduling with random operations and different priorities," International journal of production economics, vol. 40, pp. 185- 195, 1995. DOI: https://doi.org/10.1016/0925-5273(95)00078-8
D. Golenko-Ginzburg and A. Gonik, "Using “look ahead” techniques in job-shop scheduling with random operations," International journal of production economics, vol. 50, pp. 13-22, 1997. DOI: https://doi.org/10.1016/S0925-5273(97)00018-2
D. Golenko-Ginzburg and A. Gonik, "Optimal job-shop scheduling with random operations and cost objectives," International Journal of Production Economics, vol. 76, pp. 147-157, 2002. DOI: https://doi.org/10.1016/S0925-5273(01)00140-2
Y. Yoshitomi, "A genetic algorithm approach to solving stochastic job‐shop scheduling problems," International Transactions in Operational Research, vol. 9, pp. 479-495, 2002. DOI: https://doi.org/10.1111/1475-3995.00368
Y. Yoshitomi and R. Yamaguchi, "A genetic algorithm and the Monte Carlo method for stochastic job‐shop scheduling," International Transactions in Operational Research, vol. 10, pp. 577-596, 2003. DOI: https://doi.org/10.1111/1475-3995.00429
R. Tavakkoli-Moghaddam, F. Jolai, F. Vaziri, P. Ahmed, and A. Azaron, "A hybrid method for solving stochastic job shop scheduling problems," Applied mathematics and computation, vol. 170, pp. 185-206, 2005. DOI: https://doi.org/10.1016/j.amc.2004.11.036
T.-C. Lai, Y. N. Sotskov, N. Y. Sotskova, and F. Werner, "Optimal makespan scheduling with given bounds of processing times," Mathematical and Computer Modelling, vol. 26, pp. 67-86, 1997. DOI: https://doi.org/10.1016/S0895-7177(97)00132-5
T. Lai and Y. N. Sotskov, "Sequencing with uncertain numerical data for makespan minimisation," Journal of the Operational Research Society, vol. 50, pp. 230-243, 1999. DOI: https://doi.org/10.1057/palgrave.jors.2600690
T.-C. Lai, Y. N. Sotskov, N. Sotskova, and F. Werner, "Mean flow time minimization with given bounds of processing times," European Journal of Operational Research, vol. 159, pp. 558-573,2004. DOI: https://doi.org/10.1016/S0377-2217(03)00424-7
P. B. Luh, D. Chen, and L. S. Thakur, "An effective approach for job-shop scheduling with uncertain processing requirements," IEEE Transactions on Robotics and Automation, vol. 15, pp. 328-339, 1999. DOI: https://doi.org/10.1109/70.760354
K. Neumann and W. G. Schneider, "Heuristic algorithms for job‐shop scheduling problems with stochastic precedence constraints," Annals of Operations Research, vol. 92, pp. 45-63, 1999. DOI: https://doi.org/10.1023/A:1018955319343
D. Alcaide, A. Rodriguez-Gonzalez, and J. Sicilia, "A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures," International Journal of Flexible Manufacturing Systems, vol. 17, pp. 201-226, 2005. DOI: https://doi.org/10.1007/s10696-006-8819-1
M. R. Garey, D. S. Johnson, and R. Sethi, "The complexity of flowshop and jobshop scheduling,"Mathematics of operations research, vol. 1, pp. 117-129, 1976. DOI: https://doi.org/10.1287/moor.1.2.117
M. Dell'Amico and M. Trubian, "Applying tabu search to the job-shop scheduling problem," Annals of Operations research, vol. 41, pp. 231-252, 1993. DOI: https://doi.org/10.1007/BF02023076
A. Ponsich and C. A. C. Coello, "A hybrid differential evolution—tabu search algorithm for the solution of job-shop scheduling problems," Applied Soft Computing, vol. 13, pp. 462-474, 2013. DOI: https://doi.org/10.1016/j.asoc.2012.07.034
H. R. Lourenco, "Job-shop scheduling: Computational study of local search and large-step optimization methods," European Journal of Operational Research, vol. 83, pp. 347-364, 1995. DOI: https://doi.org/10.1016/0377-2217(95)00012-F
M. Faccio, J. Ries, and N. Saggiorno, "Simulated annealing approach to solve dual resource constrained job shop scheduling problems: layout impact analysis on solution quality," International Journal of Mathematics in Operational Research, vol. 7, pp. 609-629, 2015. DOI: https://doi.org/10.1504/IJMOR.2015.072274
R. Cheng, M. Gen, and Y. Tsujimura, "A tutorial survey of job-shop scheduling problems using genetic algorithms—I. Representation," Computers & industrial engineering, vol. 30, pp. 983-997, 1996. DOI: https://doi.org/10.1016/0360-8352(96)00047-2
Y. Wang, "A new hybrid genetic algorithm for job shop scheduling problem," Computers &Operations Research, vol. 39, pp. 2291-2299, 2012.
D. Sha and C.-Y. Hsu, "A hybrid particle swarm optimization for job shop scheduling problem," Computers & Industrial Engineering, vol. 51, pp. 791-808, 2006. DOI: https://doi.org/10.1016/j.cie.2006.09.002
T.-L. Lin, S.-J. Horng, T.-W. Kao, Y.-H. Chen, R.-S. Run, R.-J. Chen, et al., "An efficient job-shop scheduling algorithm based on particle swarm optimization," Expert Systems with Applications, vol. 37, pp. 2629-2636, 2010.
K.-L. Huang and C.-J. Liao, "Ant colony optimization combined with taboo search for the job shop scheduling problem," Computers & operations research, vol. 35, pp. 1030-1046, 2008.
A. Udomsakdigool and V. Kachitvichyanukul, "Multiple colony ant algorithm for job-shop scheduling problem," International Journal of Production Research, vol. 46, pp. 4155-4175, 2008.
P. Quanke, W. Ling, and G. Liang, "Differential evolution algorithm based on blocks on critical path for job shop scheduling problems," Journal of Mechanical Engineering, vol. 46, pp. 182-188, 2010. DOI: https://doi.org/10.3901/JME.2010.22.182
L. Gao, G. Zhang, L. Zhang, and X. Li, "An efficient memetic algorithm for solving the job shop scheduling problem," Computers & Industrial Engineering, vol. 60, pp. 699-705, 2011. DOI: https://doi.org/10.1016/j.cie.2011.01.003
M. S. Al-Ashhab, Munshi, S., Oreijah, M., & Ghulman, H., "Job Shop Scheduling Using Mixed Integer Programming," International Journal of Modern Engineering Research, vol. 7, p. 7, 2017.
K. R. Baker and B. Keller, "Solving the single-machine sequencing problem using integer programming," Computers & Industrial Engineering, vol. 59, pp. 730-735, 2010. DOI: https://doi.org/10.1016/j.cie.2010.07.028
M. Al-Ashhab, "Multi-Objective Job Shop Scheduling Using a Lexicographic Procedure."
N. Palisade, "Guide to Evolver–The genetic algorithm solver for Microsoft Excel," ed: Newfield, NY: Palisade Corporation, 1998.
How to Cite
License and Copyright Agreement
In submitting the manuscript to the journal, the authors certify that:
- They are authorized by their co-authors to enter into these arrangements.
- The work described has not been formally published before, except in the form of an abstract or as part of a published lecture, review, thesis, or overlay journal.
- That it is not under consideration for publication elsewhere.
- That its release has been approved by all the author(s) and by the responsible authorities – tacitly or explicitly – of the institutes where the work has been carried out.
- They secure the right to reproduce any material that has already been published or copyrighted elsewhere.
- They agree to the following license and copyright agreement.
Authors who publish with International Journal of Engineering Technologies and Management Research agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors can enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or edit it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
For More info, please visit CopyRight Section