Innovation strategy in industry: case of the scheduling problem on parallel identical machines
Article Sidebar
Main Article Content
Abstract
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.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
1. Proposal of Policy for Free Access Periodics
Authors whom publish in this magazine should agree to the following terms:
a. Authors should keep the copyrights and grant to the magazine the right of the first publication, with the work simultaneously permitted under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 that allows the sharing of the work with recognition of the authorship of the work and initial publication in this magazine.
b. Authors should have authorization for assuming additional contracts separately, for non-exclusive distribution of the version of the work published in this magazine (e.g.: to publish in an institutional repository or as book chapter), with recognition of authorship and initial publication in this magazine.
c. Authors should have permission and should be stimulated to publish and to distribute its work online (e.g.: in institutional repositories or its personal page) to any point before or during the publishing process, since this can generate productive alterations, as well as increasing the impact and the citation of the published work (See The Effect of Free Access).
Proposal of Policy for Periodic that offer Postponed Free Access
Authors whom publish in this magazine should agree to the following terms:
a. Authors should keep the copyrights and grant to the magazine the right of the first publication, with the work simultaneously permitted under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 [SPECIFY TIME HERE] after the publication, allowing the sharing of the work with recognition of the authorship of the work and initial publication in this magazine.
b. Authors should have authorization for assuming additional contracts separately, for non-exclusive distribution of the version of the work published in this magazine (e.g.: to publish in institutional repository or as book chapter), with recognition of authorship and initial publication in this magazine.
c. Authors should have permission and should be stimulated to publish and to distribute its work online (e.g.: in institutional repositories or its personal page) to any point before or during the publishing process, since this can generate productive alterations, as well as increasing the impact and the citation of the published work (See The Effect of Free Access).
d. They allow some kind of open dissemination. Authors can disseminate their articles in open access, but with specific conditions imposed by the editor that are related to:
Version of the article that can be deposited in the repository:
Pre-print: before being reviewed by pairs.
Post-print: once reviewed by pairs, which can be:
The version of the author that has been accepted for publication.
The editor's version, that is, the article published in the magazine.
At which point the article can be made accessible in an open manner: before it is published in the magazine, immediately afterwards or if a period of seizure is required, which can range from six months to several years.
Where to leave open: on the author's personal web page, only departmental websites, the repository of the institution, the file of the research funding agency, among others.
References
Adamu M. O., & dewunmi, A. (2012). Metaheuristics for scheduling on the parallel machine to minimize the weighted number of early and tardy jobs. Int. J. Phys. Sci.,7(10), 1641-1652.
Adamu M. O., & Adewunmi. A. (2013). Comparative study of metaheuristics for identical parallel machines, J. Eng. Technol. Res., 5(7), 207-216.
Chang, P.-C., Chen, S.-H., Lie, T., & Liu, J. Y.-C. (2011). A genetic algorithm enhanced by dominance properties for single machine scheduling problems with setup costs, International Journal of Innovational Computing Information and Control, 7(5A), 2323–2344.
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. Discrete Appl. Math, 119, 3- 36.
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, 129-139.
M'Hallah, R., & Bulfin, R. L. (2005). Minimizing the weighted number of tardy jobs of parallel processors, Eur. J. Oper. Res., 160, 471-4847.
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, RAIR. O Res, 50(1), 90-97
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), 6(6), 21-25.