Minimizing makespan in a two-machine flow shop with effects of deterioration and learning

Ji Bo Wang, Ping Ji, Edwin Tai Chiu Cheng, Dan Wang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

37 Citations (Scopus)

Abstract

We consider a two-machine flow shop scheduling problem with effects of deterioration and learning. By the effects of deterioration and learning, we mean that the processing time of a job is a function of its execution starting time and its position in a sequence. The objective is to find a sequence that minimizes the makespan. Several dominance properties and two lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm proposed to solve the problem. Two heuristic algorithms are also proposed to obtain near-optimal solutions. Computational results are presented to evaluate the performance of the proposed algorithms.
Original languageEnglish
Pages (from-to)1393-1409
Number of pages17
JournalOptimization Letters
Volume6
Issue number7
DOIs
Publication statusPublished - 1 Oct 2012

Keywords

  • Branch-and-bound algorithm
  • Deteriorating jobs
  • Flow shop
  • Learning effect
  • Makespan
  • Scheduling

ASJC Scopus subject areas

  • Control and Optimization

Cite this