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

Computers and Industrial Engineering

Volumn 47, Issue 2-3, 2004, Pages 107-121

  Ruiz Torres, Alex J ^a   López, Francisco J ^b  

^a POLYTECHNIC UNIVERSITY OF PUERTO RICO   (Puerto Rico)

^b UNIVERSITY OF TEXAS AT EL PASO   (United States)

Author keywords

Data Envelopment Analysis; Free Disposal Hull; Heuristics

Indexed keywords

DATA REDUCTION; HEURISTIC METHODS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

DATA DEVELOPMENT ANALYSIS; FREE DISPOSAL HULL; PARALLEL MACHINES;

SCHEDULING;

EID: 6344219984     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2004.06.002     Document Type: Article

References (16)

1. Banker, R. D., Charnes, A., & Cooper, W. W. (1984). Some models for estimating technological and scale inefficiencies in data envelopment analysis. Management Science, 30(9), 1078-1092.
2. Charnes, A., Cooper, W. W., & Rhodes, E. (1978). Measuring the efficiency of decision making units. European Journal of Operational Research, 2(6), 429-444.
3. Coffman, E. G., Garey, M. R., & Johnson, D. S. (1978). An application of bin-packing to multi-processor scheduling. SIAM Journal of Computing, 7(1), 1-17.
4. Deprins, D., Simar, L., & Tulkens, H. (1984). In M. Marchand, P. Pestieau, & H. Tulkens (Eds.), Measuring labor-efficiency in post offices. The performance of public enterprises: Concepts and measurements. Amsterdam: North-Holland Publishing Company.
5. Gangadharan, R., & Rajendran, C. (1994). A simulated annealing heuristic for scheduling in a flowshop with bicriteria. Computers and Industrial Engineering, 27, 473-476.
6. Graham, R. L. (1969). Bounds on multiprocessor timing anomalies. SIAM Journal of Applied Mathematics, 17, 416-429.
7. Hochbaum, D. S., & Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of ACM, 34, 144-162.
8. Ho, J. C., & Chang, Y. L. (1991). Heuristics for minimizing mean tardiness for m parallel machines. Naval Research Logistics, 38, 367-381.
9. Ho, J. C., & Chang, Y. L. (1995). Minimizing the number of tardy jobs for m parallel machines. European Journal of Operational Research, 84, 343-355.
10. Jeffcoat, D. E., & Bulfin, R. L. (1993). Simulated annealing for resource-constrained scheduling. European Journal of Operational Research, 70, 43-51.
11. Karp, R. M. (1972). Reducibility among combinatorial problems. Complexity of computer computations. New York: Plenum Press pp. 85-104.
12. Lee, C. Y., & Massey, J. D. (1988). Multiprocessor scheduling: Combining LPT and MULTIFIT. Discrete Applied Mathematics, 20, 233-242.
13. Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 75(1), 102-109.
14. Osier, D., Grobman, S., & Baston, S. (1997). Teach yourself Delphi 3 in 14 days. Indiana: SAMS Publishing.
15. Suresh, V., & Chaudhuri, D. (1994). Minimizing maximum tardiness for unrelated parallel machines. International Journal of Production Economics, 34, 223-229.
16. Zegordi, S. H., Itoh, K., & Enkawa, T. (1995). Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge. European Journal of Operational Research, 85, 515-531.