Scheduling with flexible resources in parallel workcenters to minimize maximum completion time

Computers and Operations Research

Volumn 34, Issue 1, 2007, Pages 48-69

  Ruiz Torres, Alex J ^a   Centeno, Grisselle ^b  

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

^b UNIVERSITY OF SOUTH FLORIDA   (United States)

Author keywords

Dual resource scheduling; Makespan; Maximum completion time; Parallel machines scheduling

Indexed keywords

COMPETITION; HEURISTIC METHODS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

DUAL RESOURCE SCHEDULING; MAKESPAN; MAXIMUM COMPLETION TIME; PARALLEL MACHINES SCHEDULING;

RESOURCE ALLOCATION;

EID: 33746239345     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.02.042     Document Type: Article

References (11)

1. Daniels R.L., Hua S.Y., and Webster S. Heuristics for parallel machine flexible resource scheduling problems with unspecified job assignment. Computers and Operations Research 26 (1999) 143-155
2. Daniels R.L., Hoopes B.J., and Mazzola J.B. Scheduling parallel manufacturing cells with resource flexibility. Management Science 42 (1996) 1260-1276
3. Olafsson S., and Shi L. A method for scheduling in parallel manufacturing systems with flexible resources. IIE Transactions 32 (2000) 135-146
4. Kellerer H., and Strusevich V.A. Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics 133 1-3 (2004) 45-68
5. Jensen J.B. The impact of resource flexibility and staffing decisions on cellular and departmental performance. European Journal of Operational Research 127 (2000) 279-296
6. Liao C.J., and Lin C.J. Makespan minimization for two uniform parallel machines. International Journal of Production Economics 84 (2003) 205-213
7. Koulamas C., and Kyparisis G. Makespan minimization on uniform parallel machines with release times. European Journal of Operational Research 157 (2004) 262-266
8. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), Freeman, San Francisco
9. Ishii H., Martel C., Masuda T., and Nishida T. Generalized uniform processor system. Operations Research 33 2 (1985) 346-362
10. Coffman E.G., Garey M.R., and Johnson D.S. An application of bin-packing to multi-processor scheduling. SIAM Journal of Computing 7 (1978) 1-17
11. Lee C.Y., and Massey J.D. Multiprocessor scheduling: combining LPT and MULTIFIT. Discrete Applied Mathematics 20 (1988) 233-242