A note on "schedule of n jobs on two identical machines to minimize weighted mean flor time"

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In a recent paper, Alidaee [Computers ind. Engng 24, 53-55 (1993)] notes the similarity between the scheduling problems of minimizing weighted mean flow time (WMFT) on two parallel machines and minimmizing weighted earliness/tardiness (WET) about a common due date on a single machine. Based on this similarity, Alidaee descirbes how a dynamic programming algorithm proposed by Hall and Posner [Opns Res. 39, 836-846 (1991)] for the WET problem can be modified and applied to the WMFT problem. The work is an important extension of earlier results on an equivalence relationship between the WMFT and WET problems. This Note helps consolidate the literature by recognizing Rothkopf [Mgmt Sci. 12, 437-447 (1966)] as the originator of algorithm described in [Computers ind. Engng 24 53-55 (1993)].

Original languageEnglish (US)
Pages (from-to)795-796
Number of pages2
JournalComputers and Industrial Engineering
Volume26
Issue number4
DOIs
StatePublished - 1994
Externally publishedYes

Fingerprint

Earliness-tardiness
Weighted Mean
Flow Time
Schedule
Minimise
Dynamic programming
Common Due Date
Scheduling
Parallel Machines
Single Machine
Dynamic Programming
Scheduling Problem
Equivalence
Flow time
Tardiness
Similarity

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this

A note on "schedule of n jobs on two identical machines to minimize weighted mean flor time". / Webster, Scott.

In: Computers and Industrial Engineering, Vol. 26, No. 4, 1994, p. 795-796.

Research output: Contribution to journalArticle

@article{72fb2c5dc3b743fa847c1541dcce4ac9,
title = "A note on {"}schedule of n jobs on two identical machines to minimize weighted mean flor time{"}",
abstract = "In a recent paper, Alidaee [Computers ind. Engng 24, 53-55 (1993)] notes the similarity between the scheduling problems of minimizing weighted mean flow time (WMFT) on two parallel machines and minimmizing weighted earliness/tardiness (WET) about a common due date on a single machine. Based on this similarity, Alidaee descirbes how a dynamic programming algorithm proposed by Hall and Posner [Opns Res. 39, 836-846 (1991)] for the WET problem can be modified and applied to the WMFT problem. The work is an important extension of earlier results on an equivalence relationship between the WMFT and WET problems. This Note helps consolidate the literature by recognizing Rothkopf [Mgmt Sci. 12, 437-447 (1966)] as the originator of algorithm described in [Computers ind. Engng 24 53-55 (1993)].",
author = "Scott Webster",
year = "1994",
doi = "10.1016/0360-8352(94)90014-0",
language = "English (US)",
volume = "26",
pages = "795--796",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",
number = "4",

}

TY - JOUR

T1 - A note on "schedule of n jobs on two identical machines to minimize weighted mean flor time"

AU - Webster, Scott

PY - 1994

Y1 - 1994

N2 - In a recent paper, Alidaee [Computers ind. Engng 24, 53-55 (1993)] notes the similarity between the scheduling problems of minimizing weighted mean flow time (WMFT) on two parallel machines and minimmizing weighted earliness/tardiness (WET) about a common due date on a single machine. Based on this similarity, Alidaee descirbes how a dynamic programming algorithm proposed by Hall and Posner [Opns Res. 39, 836-846 (1991)] for the WET problem can be modified and applied to the WMFT problem. The work is an important extension of earlier results on an equivalence relationship between the WMFT and WET problems. This Note helps consolidate the literature by recognizing Rothkopf [Mgmt Sci. 12, 437-447 (1966)] as the originator of algorithm described in [Computers ind. Engng 24 53-55 (1993)].

AB - In a recent paper, Alidaee [Computers ind. Engng 24, 53-55 (1993)] notes the similarity between the scheduling problems of minimizing weighted mean flow time (WMFT) on two parallel machines and minimmizing weighted earliness/tardiness (WET) about a common due date on a single machine. Based on this similarity, Alidaee descirbes how a dynamic programming algorithm proposed by Hall and Posner [Opns Res. 39, 836-846 (1991)] for the WET problem can be modified and applied to the WMFT problem. The work is an important extension of earlier results on an equivalence relationship between the WMFT and WET problems. This Note helps consolidate the literature by recognizing Rothkopf [Mgmt Sci. 12, 437-447 (1966)] as the originator of algorithm described in [Computers ind. Engng 24 53-55 (1993)].

UR - http://www.scopus.com/inward/record.url?scp=0028532204&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028532204&partnerID=8YFLogxK

U2 - 10.1016/0360-8352(94)90014-0

DO - 10.1016/0360-8352(94)90014-0

M3 - Article

AN - SCOPUS:0028532204

VL - 26

SP - 795

EP - 796

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

IS - 4

ER -