An improved solution procedure for the n/1//formula presented {γi(ci)) →Σci, scheduling problem

Research output: Journal article publicationJournal articleAcademic researchpeer-review

5 Citations (Scopus)

Abstract

Given a set of n jobs to be processed on a single machine, the problem is to find an optimal job sequence that hierarchically minimizes a bi-criterion objective function. The primary criterion is the maximum value of a general non-decreasing penalty function of job completion time, while the secondary criterion is total job flow time. An extension of Emmons’s result is presented on the basis of which an improved solution procedue is developed to reduce the computational effort to find the optimal solution.
Original languageEnglish
Pages (from-to)413-417
Number of pages5
JournalJournal of the Operational Research Society
Volume42
Issue number5
DOIs
Publication statusPublished - 1 Jan 1991
Externally publishedYes

Keywords

  • Bi-criterion
  • Scheduling
  • Sequencing

ASJC Scopus subject areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing

Cite this