Equivalence of mean flow time problems and mean absolute deviation problems

Authors:
W. Kubiak;S. Lou;S. Sethi
Affiliations:
Faculty of Management, University of Toronto, 246 Bloor Street West, Toronto M5S IV4, Ontario, Canada;Faculty of Management, University of Toronto, 246 Bloor Street West, Toronto M5S IV4, Ontario, Canada;Faculty of Management, University of Toronto, 246 Bloor Street West, Toronto M5S IV4, Ontario, Canada
Venue:
Operations Research Letters
Year:
1990

Citing 2
Cited 5

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM

Exponential neighborhood search for a parallel machine scheduling problem

Computers and Operations Research
Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs

Computers and Operations Research
Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties

Mathematical and Computer Modelling: An International Journal
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling: An International Journal
A multi-agent system for the weighted earliness tardiness parallel machine problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The mean flow time problem and the mean absolute deviation problem for multiple uniform parallel machines are shown to be equivalent. For multiple unrelated parallel machines, a reduction of the mean absolute deviation problem into a transportation problem is presented.