American Journal of Modeling and Optimization
ISSN (Print): 2333-1143 ISSN (Online): 2333-1267 Website: http://www.sciepub.com/journal/ajmo Editor-in-chief: Dr Anil Kumar Gupta
Open Access
Journal Browser
Go
American Journal of Modeling and Optimization. 2019, 7(1), 8-13
DOI: 10.12691/ajmo-7-1-2
Open AccessArticle

Multi-objective Job Shop Scheduling Using Pre-emptive Constraint Procedure

Jaber S. Alzahrani1,

1Department of Industrial Engineering, Engineering College at Alqunfudah, Umm Al-Qura University, Saudi Arabia

Pub. Date: April 26, 2019

Cite this paper:
Jaber S. Alzahrani. Multi-objective Job Shop Scheduling Using Pre-emptive Constraint Procedure. American Journal of Modeling and Optimization. 2019; 7(1):8-13. doi: 10.12691/ajmo-7-1-2

Abstract

In this paper, a multi-objective job shop scheduling through the pre-emptive constraint procedure has been formulated to optimize makespan, total earliness and total tardiness. The effectiveness of the model is studied through eighteen 3J*3M and three 10J*10M problems. The model is solved using Mosel language with Xpress software.

Keywords:
multi-objectives goal programming job shop mixed integer programming pre-emptive constraint procedure

Creative CommonsThis work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References:

[1]  G. Zhang, X. Shao, P. Li, and L. Gao, "An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem," Computers & Industrial Engineering, vol. 56, pp. 1309-1318, 2009.
 
[2]  A. Scaria, K. George, and J. Sebastian, "An Artificial Bee Colony Approach for Multi-objective Job Shop Scheduling," Procedia Technology, vol. 25, pp. 1030-1037, 2016.
 
[3]  K. R. Baker and B. Keller, "Solving the single-machine sequencing problem using integer programming," Computers & Industrial Engineering, vol. 59, pp. 730-735, 2010.
 
[4]  H. M. Wagner, “An integer linear‐programming model for machine scheduling,” Naval Research Logistics (NRL), vol. 6, pp. 131-140, 1959.
 
[5]  A. S. Manne, “On the job-shop scheduling problem,” Operations Research, vol. 8, pp. 219-223, 1960.
 
[6]  R. L. Becerra and C. A. Coello Coello, "Epsilon-constraint with an efficient cultured differential evolution," in Proceedings of the 9th annual conference companion on Genetic and evolutionary computation, 2007, pp. 2787-2794.
 
[7]  M. Laumanns, L. Thiele, and E. Zitzler, "An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method," European Journal of Operational Research, vol. 169, pp. 932-942, 2006.
 
[8]  R. T. Marler and J. S. Arora, "Survey of multi-objective optimization methods for engineering," Structural and multidisciplinary optimization, vol. 26, pp. 369-395, 2004.
 
[9]  J.-F. Bérubé, M. Gendreau, and J.-Y. Potvin, "An exact ϵ-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits," European journal of operational research, vol. 194, pp. 39-50, 2009.
 
[10]  M. Al-Ashhab, "Multi-Objective Job Shop Scheduling Using a Lexicographic Procedure," International Journal of Engineering Science Invention (IJESI), vol. 7, p. 10, 2018.
 
[11]  M. Boulif and K. Atif, "An exact multiobjective epsilon-constraint approach for the manufacturing cell formation problem," in Service systems and service management, 2006 International Conference on, 2006, pp. 883-888.
 
[12]  M. Esmaili, N. Amjady, and H. A. Shayanfar, "Multi-objective congestion management by modified augmented ε-constraint method," Applied Energy, vol. 88, pp. 755-766, 2011.
 
[13]  L. Grandinetti, F. Guerriero, D. Laganà, and O. Pisacane, "An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem," Computers & Operations Research, vol. 39, pp. 2300-2309, 2012.
 
[14]  https://es.scribd.com/document/48640996/optimizer.