Innovation strategy in industry: case of the scheduling problem on parallel identical machines

• Autores: Omar Selt
• Localización: Independent Journal of Management & Production, ISSN-e 2236-269X, Vol. 13, Nº. 1, 2022 (Ejemplar dedicado a: Independent Journal of Management & Production), págs. 72-84
• Idioma: inglés
• DOI: 10.14807/ijmp.v13i1.1533
• Enlaces
  • Texto completo (pdf)
• Resumen

  • In this paper, we propose an innovation strategy in the industry (case of the scheduling problem on two parallel identical machines), with the objective of minimizing the weighted sum of the end dates of jobs, this problem is NP-hard. In this frame, we suggested a novel heuristics: (H1), (H2), (H3), with two types of neighborhood (neighborhood by SWAP and neighborhood by INSERT). Next, we analyze the incorporation of three diversification times (T1), (T2), and (T3) with the aim of exploring unvisited regions of the solution space. It must be noted that job movement can be within one zone or between different zones. Computational tests are performed on 6 problems with up to 2 machines and 500 jobs.

• Referencias bibliográficas
  • Adamu M. O., & dewunmi, A. (2012). Metaheuristics for scheduling on the parallel machine to minimize the weighted number of early and...
  • Adamu M. O., & Adewunmi. A. (2013). Comparative study of metaheuristics for identical parallel machines, J. Eng. Technol. Res., 5(7),...
  • Chang, P.-C., Chen, S.-H., Lie, T., & Liu, J. Y.-C. (2011). A genetic algorithm enhanced by dominance properties for single machine scheduling...
  • Glover, F. (1986). Future paths for integer programming and links to artificial intelligence,
  • Comput. Oper. Res., 13, 533-549.
  • Glover, F., & S. Hanafi, S. (2002). Tabu Search and Finite Convergence, Special Issue on Foundations of heuristics in Combinatorial Optimization....
  • Lee. C. Y. (1996). Machine scheduling with an availability constraints, J. Global Optim., 9, 395-416.
  • Lee C. Y. (1997). Minimising the makespan in two machines flow shop scheduling problem with availability constraints, Oper. Res. Lett., 20,...
  • M'Hallah, R., & Bulfin, R. L. (2005). Minimizing the weighted number of tardy jobs of parallel processors, Eur. J. Oper. Res., 160,...
  • Sakarovitch, M. (1984). Optimisation combinatoire: Programmation discrete, Hermann, France.
  • Schmidt, G. (2000). Scheduling with limited machine availability, European J. Oper., 121, 1-15.
  • Schmidt, G. (1984). Scheduling on semi-identical processors. Z. Oper. Res., A28, 153-162.
  • Selt, O., & Zitouni, R. (2014). A comparative study of heuristic and metaheuristic for three identical parallel machines, Cjpas, 3147-3153.
  • Zitouni, R., & Selt, O. (2016). Metaheuristics to solve tasks scheduling problem in parallel identical machines with unavailability periods,...
  • Smith, W. E. (1956). Various optimizes for single-stage production, Nava Res. Logistc, 3, 59- 66.
  • Zribi, N., Kacem, I., El-Kamel, A., & Borne, P. (2005). Minimisation de la somme des retards dans un job shop flexible, Revue e-STA (SEE),...