A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system

Dvir Shabtay, Yaron Bensoussan, Moshe Kaspi

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

We analyze a two-machine flow-shop scheduling problem in which the job processing times are controllable by the allocation of resources to the job operations and the resources can be used in discrete quantities. We provide a bicriteria analysis of the problem where the first criterion is to maximize the weighted number of just-in-time jobs and the second criterion is to minimize the total resource consumption cost. We prove that although the problem is known to be NP-hard even for constant processing times, a pseudo-polynomial time algorithm for its solution exists. In addition, we show how the pseudo-polynomial time algorithm can be converted into a two-dimensional fully polynomial approximation scheme for finding an approximate Pareto solution.

Original languageEnglish
Pages (from-to)67-74
Number of pages8
JournalInternational Journal of Production Economics
Volume136
Issue number1
DOIs
StatePublished - 1 Mar 2012

Keywords

  • Controllable processing times
  • FPTAS
  • Flow shop
  • Just-in-time scheduling
  • Pseudo-polynomial time algorithm
  • Resource allocation

ASJC Scopus subject areas

  • Business, Management and Accounting (all)
  • Economics and Econometrics
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system'. Together they form a unique fingerprint.

Cite this