﻿<?xml version="1.0" encoding="UTF-8"?>
<records>
  <record>
    <language>eng</language>
    <publisher>Science and Education Publishing</publisher>
    <journalTitle>American Journal of Modeling and Optimization</journalTitle>
    <eissn>2333-1267</eissn>
    <publicationDate>2019-04-26</publicationDate>
    <volume>7</volume>
    <issue>1</issue>
    <startPage>8</startPage>
    <endPage>13</endPage>
    <doi>10.12691/ajmo-7-1-2</doi>
    <publisherRecordId>AJMO2019712</publisherRecordId>
    <documentType>article</documentType>
    <title language="eng">Multi-objective Job Shop Scheduling Using Pre-emptive Constraint Procedure</title>
    <authors>
      <author>
        <name>Jaber S. Alzahrani</name>
        <email>jszahrani@ uqu.edu.sa</email>
        <affiliationId>1</affiliationId>
      </author>
    </authors>
    <affiliationsList>
      <affiliationName affiliationId="1">Department of Industrial Engineering, Engineering College at Alqunfudah, Umm Al-Qura University, Saudi Arabia</affiliationName>
    </affiliationsList>
    <abstract language="eng">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.</abstract>
    <fullTextUrl format="pdf">http://pubs.sciepub.com/ajmo/7/1/2/ajmo-7-1-2.pdf</fullTextUrl>
    <keywords language="eng">
      <keyword>multi-objectives</keyword>
      <keyword>goal programming</keyword>
      <keyword>job shop</keyword>
      <keyword>mixed integer programming</keyword>
      <keyword>pre-emptive constraint procedure</keyword>
    </keywords>
  </record>
</records>