Further study of minimizing total flowtime for the worker assignment scheduling problem in the identical parallel-machine models

International Journal of Advanced Manufacturing Technology

Volumn 29, Issue 7-8, 2006, Pages 753-757

  Hu, Po Chieng ^a  

^a NATIONAL FORMOSA UNIVERSITY   (Taiwan)

Author keywords

LMC procedure; Minimizing total flow time; Number of workers; SPT A heuristic; Worker assignment scheduling problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

LMC PROCEDURE; MINIMIZING TOTAL FLOW TIME; NUMBER OF WORKERS; SPT-A HEURISTIC; WORKER ASSIGNMENT SCHEDULING PROBLEM;

JOB ANALYSIS;

EID: 33745726702     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-005-2555-7     Document Type: Article

References (16)

1. Gupta JND, Maykut AR (1973) Scheduling jobs on parallel processors with dynamic programming. Decis Sci 4(4):447-457
2. Dogramaci A, Surkis J (1979) Evaluation of a heuristic for scheduling independent jobs on parallel identical processors. Manage Sci 25(12):1208-1216
3. Hurink J, Knust S (2001) List scheduling in a parallel machine environment with precedence constraints and setup times. Oper Res Lett 29:231-239
4. Suie DR, Vijayasundaram K (1998) A heuristic procedure for makespan minimization in job shops with multiple identical processors. Comput Ind Eng 35(3-4):399-402
5. Alon N, Azar Y, Woeginger GJ, Yadid T (1998) Approximation schemes for scheduling on parallel machines. J Sched 1(1):55-66
6. Webster S (1993) A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems. Eur J Oper Res 70:327-334
7. Webster S (1993) Bounds and asymptotic results for the uniform parallel processor weighted flow time problem. Oper Res Lett 14:85-90
8. Webster S (1994) A note on 'schedule of n jobs on two identical machines to minimize weighted mean flow time'. Comput Ind Eng 26:795-796
9. Webster S (1995) Weighted flow time bounds for scheduling identical processors. Eur J Oper Res 80:103-111
10. Azizoglu M, Webster S (2003) Scheduling parallel machines to minimize weighted flowtime with family set-up times. Int J Prod Res 41(6):1199-1215
11. Rothkopf MH (1966) Scheduling independent tasks on parallel processors. Manage Sci 12(5):437-447
12. Du J, Leung JY-H (1989) Complexity of scheduling parallel task systems. SIAM J Discret Math 2(4):473-487
13. Ghosal D, Serazzi G, Tripathi SK (1991) The processor working set and its use in scheduling multiprocessor systems. IEEE Trans Softw Eng 17(5):443-453
14. Wand Q, Cheng KH (1992) A heuristic of scheduling parallel tasks and its analysis. SIAM J Comput 21(2):281-294
15. Cheng TCE, Kovalyov M (2000) Parallel machine batching and scheduling with deadlines. J Sched 3(2):109-123
16. Hu P-C (2004) Minimizing total flowtime for the worker assignment scheduling problem in the identical parallel-machine models, Int J Adv Manuf Technol (online 7 April 2004)