Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models

International Journal of Advanced Manufacturing Technology

Volumn 25, Issue 9-10, 2005, Pages 1046-1052

  Hu, Po Chieng ^a  

^a NATIONAL FORMOSA UNIVERSITY   (Taiwan)

Author keywords

LMC procedure; NP complete; SPT A heuristic; Tardiness; Worker assignment scheduling problem

Indexed keywords

BOUNDARY VALUE PROBLEMS; COMPUTER SIMULATION; DYNAMIC PROGRAMMING; HEURISTIC METHODS; MATHEMATICAL MODELS; PERSONNEL; PROBLEM SOLVING; SCHEDULING;

LMC PROCEDURE; NP-COMPLETE; SPT-A HEURISTIC; TARDINESS; WORKER ASSIGNMENT SCHEDULING PROBLEM;

JOB ANALYSIS;

EID: 18144417504     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-003-1989-z     Document Type: Article

References (24)

1. Alon N, Azar Y, Woeginger GJ, Yadid T (1998) Approximation schemes for scheduling on parallel machines. J Schedul 1:55-66
2. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, pp 10-11
3. Barnes JW, Brennan JJ (1977) An improved algorithm for scheduling jobs on identical machines. AIIE Trans 9
4. Bruno J, Coffman EG Jr, Sethi R (1974) Scheduling independent tasks to reduce mean finishing time. Comm ACM 17:382-387
5. Cheng TCE, Kovalyov M (2000) Parallel machine batching and scheduling with deadlines. J Schedul 3:109-123
6. Dogramaci A, Surkis J (1979) Evaluation of a heuristic for scheduling independent jobs on parallel identical processors. Manage Sci 25:12081216
7. Du J, Leung JY-H (1989) Complexity of scheduling parallel task systems. SIAM J Discret Math 2:473-487
8. Feitelson DG, Rudolph L, Schwiegelshohn U, Sevcik KC, Wong P (1997) Theory and practice in parallel job scheduling. Third workshop on job scheduling strategies for parallel processing, in conjunction with IPPS 1997. University of Geneva, Geneva, Switzerland, 5 April 1997, pp 1-25
9. French S (1982) Sequencing and scheduling: an introduction to the mathematics of the job shop. Ellis Horwood Limited, Chichester, pp 8-9, 27, 37
10. Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, New York, p 245
11. Ghosal D, Serazzi G, Tripathi SK (1991 ) The processor working set and its use in scheduling multiprocessor systems. IEEE Trans Softw Eng 17:443-453
12. Gupta JND, Maykut AR (1973) Scheduling jobs on parallel processors with dynamic programming. Decision Sci 4:447-457
13. Hu P (1993) An efficient heuristic for the worker assignment problem in the identical and nonidentical parallel-machine models. Dissertation, Department of Industrial and Management Systems Engineering, The Pennsylvania State University, University Park, Pennsylvania, pp 2, 30-32, 41-42, 57
14. Hurink J, Knust S (2001) List scheduling in a parallel machine environment with precedence constraints and setup times. Oper Res Lett 29:231-239
15. Iwamoto S (2001) Fuzzy decision-making through three dynamic programming approaches. Int J Fuzzy Syst 3:520-526
16. Jain AS, Meeran S (1998) Job-shop scheduling using neural Networks. Int J Prod Res 36:1249-1272
17. Jansen K, Solis-Oba R, Sviridenko M (1999) Makespan minimization in job shops: a polynomial time approximation scheme. Proceedings of the 31st annual ACM symposium on theory of computing (STOC' 1999), pp 394-399
18. Jones A, Rabelo, LC (1998) Survey of job shop scheduling Techniques. NISTIR, National Institute of Standards and Technology, Gaithersburg, MD
19. Rajaraman MK (1975) An algorithm for scheduling parallel processors. Int J Prod Res 13:479-486
20. Rothkopf MH (1966) Scheduling independent tasks on parallel processors. Manage Sci 12:437-447
21. Suie DR, Vijayasundaram K (1998) A heuristic procedure for makespan minimization in job shops with multiple identical processors. Comput Industr Eng 35:399-402
22. Wand Q, Cheng KH (1992) A heuristic of scheduling parallel tasks and its analysis. SIAM J Comput 21:281-294
23. Yamada T, Nakeno R (1990) Job-shop scheduling by simulated annealing combined with deterministic local search. Kruwei Academic, MA, pp 237-246
24. Yamada T, Nakano R (1997) Genetic algorithms for job-shop scheduling problems. Proceedings of Modern Heuristic for Decision Support, UNICOM seminar, 18-19 March 1997, London, pp 67-81