Using the FDH formulation of DEA to evaluate a multi-criteria problem in parallel machine scheduling

Authors:
Alex J. Ruiz-Torres;Francisco J. López
Affiliations:
Department of Industrial Engineering, College of Engineering, Polytechnic University of Puerto Rico, San Juan, PR 00919-2017, Puerto Rico;Department of Information and Decision Sciences, College of Business Administration, University of Texas at El Paso, El Paso, TX
Venue:
Computers and Industrial Engineering
Year:
2004

Citing 4
Cited 1

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Multiprocessor scheduling: combining LPT and MULTIFIT

Discrete Applied Mathematics
A simulated annealing heuristic for scheduling in a flowshop with bicriteria

ICC&IE-94 Selected papers from the 16th annual conference on Computers and industrial engineering
Teach Yourself Delphi 3 in 14 Days

Teach Yourself Delphi 3 in 14 Days

Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling jobs on parallel machines when there are two criteria to optimize, namely, minimizing both the makespan and the number of tardy jobs. We propose four heuristics to find solutions to this problem, which we evaluate and compare using the Free Disposal Hull (FDH) formulation of Data Envelopment Analysis (DEA). Our approach illustrates how DEA can be used to compare the performance of heuristics in a multi-criteria environment. We also analyze the impact that some scheduling elements, like the number of machines, the ratio jobs/machines, the congestion, etc. have on the heuristics.