Open Science Research Excellence
@article{(International Science Index):http://waset.org/publications/10006691,
  title    = {Job Shop Scheduling: Classification, Constraints and Objective Functions},
  author    = {Majid Abdolrazzagh-Nezhad and  Salwani Abdullah},
  country   = {Malaysia},
  institution={Universiti Kebangsaan Malaysia},
  abstract  = {The job-shop scheduling problem (JSSP) is an important decision facing those involved in the fields of industry, economics and management. This problem is a class of combinational optimization problem known as the NP-hard problem. JSSPs deal with a set of machines and a set of jobs with various predetermined routes through the machines, where the objective is to assemble a schedule of jobs that minimizes certain criteria such as makespan, maximum lateness, and total weighted tardiness. Over the past several decades, interest in meta-heuristic approaches to address JSSPs has increased due to the ability of these approaches to generate solutions which are better than those generated from heuristics alone. This article provides the classification, constraints and objective functions imposed on JSSPs that are available in the literature.},
    journal   = {International Journal of Computer, Electrical, Automation, Control and Information Engineering},  volume    = {11},
  number    = {4},
  year      = {2017},
  pages     = {429 - 434},
  ee        = {http://waset.org/publications/10006691},
  url       = {http://waset.org/Publications?p=124},
  bibsource = {http://waset.org/Publications},
  issn      = {eISSN:1307-6892},
  publisher = {World Academy of Science, Engineering and Technology},
  index     = {International Science Index 124, 2017},
}