A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups

In Chan Choi, Dae Sik Choi

Research output: Contribution to journalArticle

52 Citations (Scopus)

Abstract

Alternative operation sequences and sequence-dependent setups are two important factors that frequently appear in various manufacturing environments and in project scheduling. This paper addresses a jobshop scheduling problem with these factors simultaneously considered. In it, a mixed integer program model of the problem is presented, along with a local search scheme. The local search scheme utilizes a property identified to reduce computation time. In addition, a property that establishes a performance bound is presented. Results from a comparative computational study using benchmark data show that the scheme significantly enhances the performance of several greedy-based dispatching rules for the problem under consideration.

Original languageEnglish
Pages (from-to)43-58
Number of pages16
JournalComputers and Industrial Engineering
Volume42
Issue number1
DOIs
Publication statusPublished - 2002 Apr

Keywords

  • Alternative operations
  • Jobshop
  • Mixed integer program
  • Scheduling
  • Sequence-dependent set-ups

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups'. Together they form a unique fingerprint.

  • Cite this