A LISTFIT heuristic for minimizing makespan on identical parallel machines

Production Planning and Control

Volumn 12, Issue 1, 2001, Pages 28-36

  Gupta, Jatinder N D ^a   Ruiz Torres, J ^b  

^a BALL STATE UNIVERSITY   (United States)

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

Author keywords

Empirical results; Listfit heuristic; Minimizing makespan; Parallel machine scheduling

Indexed keywords

COMPUTER SYSTEMS; HEURISTIC METHODS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

PARALLEL MACHINES;

PRODUCTION ENGINEERING;

EID: 0035241046     PISSN: 09537287     EISSN: None     Source Type: Journal    
DOI: 10.1080/09537280150203951     Document Type: Article

References (12)

1. Amar, A.D., and Gupta, J.N.D., 1986, Simulated versus real life data in testing the efficiency of scheduling algorithms. IIE Transactions, 18, 16-25.
2. Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., and Weolarz, J., 1996. Scheduling Computer and Manufacturing Systems. (Berlin: Springer).
3. Coffman, E.G., Garey, M.R., and Johnson, D.S., 1978. An application of bin-packing to multi-processor scheduling. SIAM Journal of Computing, 7, 1-17.
4. Friesen, D.K., 1984. Tighter bounds for the MULTIFIT processor scheduling algorithm. SIAM Journal of Computing, 13, 170-181.
5. Gareey, M.R., and Johnson, J.S., 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness (San Francisco, CA: Freeman).
6. Graham, R.L., 1969. Bounds on multiprocessor timing anomalies. SIAM Journal of Applied Mathematics, 17, 416-429.
7. Hax, A., and Candea, D., 1984, Production and Inventory Management (Englewood Cliffs, NJ: Prentice Hall).
8. Kedia, S.K., 1971. A job scheduling problem with parallel processors. Unpublished Report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI.
9. Lee, C.Y., and Massey, J.D., 1988. Mnltiprocessor scheduling: combining LPT and MULTIFIT. Discrete Applied Mathematics, 20, 233-242.
10. Pinedo, M., and Chao, X., 1999, Operations Scheduling with Applications in Manufacturing and Services. (Boston, MA: Irwin/McGraw Hill).
11. max problem. TOP, 4, 345-359.
12. Yue, M., 1990. On the exact upper bound for the multifit processor algorithm. Annals of Operations Research, 24, 233-259.