A mathematical model for job shop scheduling with multiple process plan consideration per job

Kun Hyung Kim, Pius J. Egbelu

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

In this paper, a mixed integer programming model is formulated for scheduling a set of jobs through a shop when each job is supplied or provided with multiple process plans or process routings. Simultaneous selection of a process plan for each job and the sequencing of the jobs through the machines in the shop based on the set of selected process plans is addressed. The procedure developed seek s to integrate the selection of machines for each job and the sequencing of jobs on each machine based on the objective of minimizing production make span. the application of the procedure is demonstrated with an example problem. The following conclusions were drawn as a result of the research: (1) the procedure developed produces optimal or near optimal solution; (2) the benefit from the developed approach is that it allows a shop to adaptively select process plans for jobs to optimize on production make span. By combining solution quality with scheduling flexibility and efficiency, the productivity of a shop can be greatly enhanced.

Original languageEnglish (US)
Pages (from-to)250-259
Number of pages10
JournalProduction Planning and Control
Volume9
Issue number3
DOIs
StatePublished - Jan 1 1998
Externally publishedYes

All Science Journal Classification (ASJC) codes

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

Keywords

  • Makespan
  • Process plan
  • Production planning
  • Scheduling
  • Sequencing

Fingerprint

Dive into the research topics of 'A mathematical model for job shop scheduling with multiple process plan consideration per job'. Together they form a unique fingerprint.

Cite this