Bicriteria optimisation of the makespan and meaowtime on two identical parallel machines

J. N.D. Gupta, J. C. Ho, S. Webster

Research output: Contribution to journalArticle

23 Scopus citations

Abstract

This paper proposes an efficient algorithm to solve optimally the bicriteria problem of minimising the weighted sum of makespan and mean flowtime on two identical parallel machines. The proposed algorithm allows the decision-maker to minimise makespan and flowtime simultaneously according to his or her relative preference as reflected through the weights placed on makespan and flowtime. Our computational results show that the proposed algorithm can solve optimally problem instances with a large number of jobs in a reasonably small amount of CPU time.

Original languageEnglish (US)
Pages (from-to)1330-1339
Number of pages10
JournalJournal of the Operational Research Society
Volume51
Issue number11
DOIs
StatePublished - Nov 2000
Externally publishedYes

Keywords

  • Bicriteria
  • Empirical results
  • Flowtime minimisation
  • Makespan minimisation
  • Parallel machine scheduling

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Bicriteria optimisation of the makespan and meaowtime on two identical parallel machines'. Together they form a unique fingerprint.

  • Cite this