Job shop scheduling with alternative machines

Nabil Nasr, E. A. Elsayed

Research output: Contribution to journalArticlepeer-review

130 Scopus citations


In this paper we investigate the problem of minimizing the mean flow time in a general job shop type machining system with alternative machine tool routeings. An analytical formulation of the problem as a mixed integer programming is developed. An efficient algorithm based on this formulation is developed to solve the problem by decomposing it into subproblems that are easier to solve. The algorithm solves large problems in relatively short time. A second algorithm based on the SPT rule is developed and its performance is compared with the first algorithm. A greedy procedure is also developed for the case when a penalty cost is associated with adding alternative machines. Numerical examples are given to demonstrate the use of the above algorithms.

Original languageEnglish (US)
Pages (from-to)1595-1609
Number of pages15
JournalInternational Journal of Production Research
Issue number9
StatePublished - Sep 1990

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Job shop scheduling with alternative machines'. Together they form a unique fingerprint.

Cite this