The Job Shop Scheduling Problem: Conventional and new Solution Techniques

  • Erwin Pesch
Part of the Operations Research Proceedings book series (ORP, volume 1993)


A job shop consists of a set of different machines that perform operations on jobs. Each job has a specified processing order through the machines, i.e. a job is composed of an ordered list of operations each of which is determined by the machine required and the processing time on it. There are no precedence constraints among operations of different jobs. Operations can not be interrupted (non-preemption) and each machine can handle only one job at a time. Consequently, each job can be performed on only one machine at a time. The operation sequences on the machines are unknown and have to be determined in order to minimize the makespan, i. e. the time required to complete all jobs.


Genetic Algorithm Tabu Search Combinatorial Optimization Problem Precedence Constraint Processing Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin · Heidelberg 1994

Authors and Affiliations

  • Erwin Pesch
    • 1
  1. 1.University of LimburgNL-MaastrichtThe Netherlands

Personalised recommendations