Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs

European Journal of Operational Research

Volumn 179, Issue 2, 2007, Pages 302-315

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

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

^b University System of Georgia   (United States)

Author keywords

Dual resource constrained scheduling; Number of tardy jobs; Parallel machines; Scheduling

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; RESOURCE ALLOCATION;

DUAL RESOURCE CONSTRAINED SCHEDULING; NUMBER OF TARDY JOBS; PARALLEL MACHINES;

SCHEDULING;

EID: 33751402603     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.03.028     Document Type: Article

References (14)

1. Daniels R.L., Hoopes B.J., and Mazzola J.B. Scheduling parallel manufacturing cells with resource flexibility. Management Science 42 (1996) 1260-1276
2. 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
3. Guinet A. Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria. Journal of Intelligent Manufacturing 6 (1995) 95-103
4. Gupta J.N.D., Ruiz-Torres A.J., and Webster S. Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time. Journal of the Operational Research Society 54 (2003) 1263-1274
5. Ho J.C., and Chang Y.L. Minimizing the number of tardy jobs for m parallel machines. European Journal of Operational Research 84 (1995) 343-355
6. 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
7. Kellerer H., and Strusevich V.A. Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics 133 (2003) 45-68
8. Koulamas C., and Kyrpasis G. Makespan minimization on uniform parallel machines with release times. European Journal of Operational Research 157 (2004) 262-266
9. Liao C.J., and Lin C.J. Makespan minimization for two uniform parallel machines. International Journal of Production Economics 84 (2003) 205-213
10. Lin B.M.T., and Jeng A.A.K. Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs. International Journal of Production Economics 91 (2004) 121-134
11. M'Hallah R., and Bulfin R.L. Minimizing the weighted number of tardy jobs on parallel processors. European Journal of Operational Research 160 (2005) 471-484
12. Moore J.M. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15 (1968) 102-109
13. Olafsson S., and Shi L. A method for scheduling in parallel manufacturing systems with flexible resources. IIE Transactions 32 (2000) 135-146
14. Ruiz-Torres, A.J., Centeno, G., in press. Scheduling with flexible resources in parallel workcenters to minimize maximum completion time, Computers and Operations Research.