Browse > Article
http://dx.doi.org/10.22937/IJCSNS.2022.22.8.6

Robust Multi-Objective Job Shop Scheduling Under Uncertainty  

Al-Ashhab, Mohamed S. (Department of Mechanical Engineering, College of Engineering and Islamic Architecture, Umm Al-Qura University)
Alzahrani, Jaber S. (Department of Industrial Engineering, Engineering College at Alqunfudah, Umm Al-Qura University)
Publication Information
International Journal of Computer Science & Network Security / v.22, no.8, 2022 , pp. 45-54 More about this Journal
Abstract
In this study, a multi-objective robust job-shop scheduling (JSS) model was developed. The model considered multi-jobs and multi-machines. The model also considered uncertain processing times for all tasks. Each job was assigned a specific due date and a tardiness penalty to be paid if the job was not delivered on time. If any job was completed early, holding expenses would be assigned. In addition, the model added idling penalties to accommodate the idling of machines while waiting for jobs. The problem assigned was to determine the optimal start times for each task that would minimize the expected penalties. A numerical problem was solved to minimize both the makespan and the total penalties, and a comparison was made between the results. Analysis of the results produced a prescription for optimizing penalties that is important to be accounted for in conjunction with uncertainties in the job-shop scheduling problem (JSSP).
Keywords
Job-Shop Scheduling; Optimization; Uncertainty; Xpress-IVE; Robust; Penalty;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Y. N. Sotskov, "Mixed graph colorings: A historical review," Mathematics, vol. 8, no. 3, pp. 1-24, 2020, doi: 10.3390/math8030385.   DOI
2 T. C. Lai and Y. N. Sotskov, "Sequencing with uncertain numerical data for makespan minimisation," Journal of the Operational Research Society, vol. 50, no. 3, pp. 230-243, 1999, doi: 10.1057/palgrave.jors.2600690.   DOI
3 A. Ponsich and C. A. Coello Coello, "A hybrid Differential Evolution - Tabu Search algorithm for the solution of Job-Shop Scheduling Problems," Applied Soft Computing Journal, vol. 13, no. 1, pp. 462-474, 2013, doi: 10.1016/j.asoc.2012.07.034.   DOI
4 A. J. Clewett, "Introduction to sequencing and scheduling," Journal of the Operational Research Society, vol. 28, no. 2, pp. 352-353, 1977.   DOI
5 M. S. Al-Ashhab, S. Munshi, M. Oreijah, and H. A. Ghulman, "Job Shop Scheduling Using Mixed Integer Programming," International journal of Modern Engineering Research, vol. 7, no. 3, 2017.
6 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, no. 3, pp. 558-573, 2004, doi: 10.1016/S0377-2217(03)00424-7.   DOI
7 R. H. Huang, "Multi-objective job-shop scheduling with lot-splitting production," International Journal of Production Economics, vol. 124, no. 1, pp. 206-213, 2010, doi: 10.1016/j.ijpe.2009.10.026.   DOI
8 J. Otala, A. Minard, G. Madraki, and S. Mousavian, "Graph-based modeling in shop scheduling problems: Review and extensions," Applied Sciences, vol. 11, no. 11, p. 4741, 2021, doi: 10.3390/app11114741.   DOI
9 L. Lin, M. Gen, Y. Liang, and K. Ohno, "A hybrid EA for reactive flexible job-shop scheduling," Procedia Computer Science, vol. 12, pp. 110-115, 2012, doi: 10.1016/j.procs.2012.09.039.   DOI
10 Z. Lu, W. Cui, and X. Han, "Integrated production and preventive maintenance scheduling for a single machine with failure uncertainty," Computers and Industrial Engineering, vol. 80, pp. 236-244, 2015, doi: 10.1016/j.cie.2014.12.017.   DOI
11 R. Tavakkoli-Moghaddam, F. Jolai, F. Vaziri, P. K. Ahmed, and A. Azaron, "A hybrid method for solving stochastic job shop scheduling problems," Applied Mathematics and Computation, vol. 170, no. 1, pp. 185-206, 2005, doi: 10.1016/j.amc.2004.11.036.   DOI
12 B. Calis and S. Bulkan, "A research survey: review of AI solution strategies of job shop scheduling problem," Journal of Intelligent Manufacturing, vol. 26, no. 5, pp. 961-973, 2015, doi: 10.1007/s10845-013-0837-8.   DOI
13 S. Singh and K. P. Singh, "Cuckoo Search Optimization for Job Shop Scheduling Problem," Das, K., Deep, K., Pant, M., Bansal, J., Nagar, A. (eds) Proceedings of Fourth International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol. 335, pp. 99-111, 2015.
14 P. A. Varthanan, N. Murugan, and G. M. Kumar, "A simulation based heuristic discrete particle swarm algorithm for generating integrated production-distribution plan," Applied Soft Computing Journal, vol. 12, no. 9, pp. 3034-3050, 2012, doi: 10.1016/j.asoc.2012.05.001.   DOI
15 D. Golenko-Ginzburg and A. Gonik, "Optimal job-shop scheduling with random operations and cost objectives," International Journal of Production Economics, vol. 76, no. 2, pp. 147-157, 2002, doi: 10.1016/S0925-5273(01)00140-2.   DOI
16 F. T. S. Chan, T. C. Wong, and L. Y. Chan, "Lot streaming for product assembly in job shop environment," Robotics and Computer-Integrated Manufacturing, vol. 24, no. 3, pp. 321-331, 2008, doi: 10.1016/j.rcim.2007.01.001.   DOI
17 K. R. Baker and B. Keller, "Solving the single-machine sequencing problem using integer programming," Computers & Industrial Engineering, vol. 59, no. 4, pp. 730-735, 2010.   DOI
18 A. Udomsakdigool and V. Kachitvichyanukul, "Multiple colony ant algorithm for job-shop scheduling problem," International Journal of Production Research, vol. 46, no. 15, pp. 4155-4175, 2008.   DOI
19 L. Gao, G. Zhang, L. Zhang, and X. Li, "An efficient memetic algorithm for solving the job shop scheduling problem," Computers and Industrial Engineering, vol. 60, no. 4, pp. 699-705, 2011, doi: 10.1016/j.cie.2011.01.003.   DOI
20 R. Qing-Dao-Er-Ji and Y. Wang, "A new hybrid genetic algorithm for job shop scheduling problem," Computers and Operations Research, vol. 39, no. 10, pp. 2291-2299, 2012, doi: 10.1016/j.cor.2011.12.005.   DOI
21 A. Dabah, A. Bendjoudi, A. AitZai, and N. N. Taboudjemat, "Efficient parallel tabu search for the blocking job shop scheduling problem," Soft Computing, vol. 23, no. 24, pp. 13283-13295, 2019, doi: 10.1007/s00500-019-03871-1.   DOI
22 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, no. 3, pp. 67-86, 1997, doi: 10.1016/S0895-7177(97)00132-5.   DOI
23 M. S. Al-Ashhab, "Multi-Objective Job Shop Scheduling Using a Lexicographic Procedure," International Journal of Engineering Science Invention, vol. 7, no. 1, pp. 47-56, 2018.
24 F. T. S. Chan, T. C. Wong, and L. Y. Chan, "The application of genetic algorithms to lot streaming in a job-shop scheduling problem," International Journal of Production Research, vol. 47, no. 12, pp. 3387-3412, 2009.   DOI
25 B. Wang, X. Wang, F. Lan, and Q. Pan, "A hybrid local-search algorithm for robust job-shop scheduling under scenarios," Applied Soft Computing Journal, vol. 62, pp. 259-271, 2018, doi: 10.1016/j.asoc.2017.10.020.   DOI
26 L. Lamorgese and C. Mannino, "A noncompact formulation for job-shop scheduling problems in traffic management," Operations Research, vol. 67, no. 6, pp. 1586-1609, 2019.   DOI
27 O. Sobeyko and L. Monch, "Heuristic approaches for scheduling jobs in large-scale flexible job shops," Computers and Operations Research, vol. 68, pp. 97-109, 2016, doi: 10.1016/j.cor.2015.11.004.   DOI
28 D. Y. Sha and C. Y. Hsu, "A hybrid particle swarm optimization for job shop scheduling problem," Computers and Industrial Engineering, vol. 51, no. 4, pp. 791-808, 2006, doi: 10.1016/j.cie.2006.09.002.   DOI
29 P. A. N. Quanke, W. Ling, G. A. O. Liang, and S. Hongyan, "Differential evolution algorithm based on blocks on critical path for job shop scheduling problems," Journal of Mechanical Engineering, vol. 46, no. 22, pp. 182-188, 2010.   DOI
30 S. Goren and I. Sabuncuoglu, "Robustness and stability measures for scheduling: Single-machine environment," IIE Transactions (Institute of Industrial Engineers), vol. 40, no. 1, pp. 66-83, 2008, doi: 10.1080/07408170701283198.   DOI
31 M. S. Al-Ashhab, T. Attia, and A. Shaaban, "Penalty Minimization Job Shop Scheduling under Uncertainty," International Journal of Business and General Management, vol. 8, no. 3, pp. 23-38, 2019.
32 A. Dabah, A. Bendjoudi, A. AitZai, D. El-Baz, and N. N. Taboudjemat, "Hybrid multi-core CPU and GPU-based B&B approaches for the blocking job shop scheduling problem," Journal of Parallel and Distributed Computing, vol. 117, pp. 73-86, 2018, doi: 10.1016/j.jpdc.2018.02.005.   DOI
33 G. Madraki and R. P. Judd, "Recalculating the length of the longest path in perturbed directed acyclic graph," IFAC-PapersOnLine, vol. 52, no. 13, pp. 1560-1565, 2019, doi: 10.1016/j.ifacol.2019.11.422.   DOI
34 T. L. Lin et al., "An efficient job-shop scheduling algorithm based on particle swarm optimization," Expert Systems with Applications, vol. 37, no. 3, pp. 2629-2636, 2010, doi: 10.1016/j.eswa.2009.08.015.   DOI
35 G. Madraki and R. P. Judd, "Accelerating the calculation of makespan used in scheduling improvement heuristics," Computers and Operations Research, vol. 130, p. 105233, 2021, doi: 10.1016/j.cor.2021.105233.   DOI
36 J. S. Alzahrani, "Multi-objective Job Shop Scheduling Using Pre-emptive Constraint Procedure," American Journal of Modeling and Optimization, vol. 7, no. 1, pp. 8-13, 2019, doi: 10.12691/ajmo-7-1-2.   DOI
37 Y. Mati, S. Dauzere-Peres, and C. Lahlou, "A general approach for optimizing regular criteria in the job-shop scheduling problem," European Journal of Operational Research, vol. 212, no. 1, pp. 33-42, 2011, doi: 10.1016/j.ejor.2011.01.046.   DOI
38 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, no. 6, pp. 609-629, 2015.   DOI