Minimising total tardiness for the worker assignment scheduling problem in identical parallel-machine models

International Journal of Advanced Manufacturing Technology

Volumn 23, Issue 5-6, 2004, Pages 383-388

  Hu, Po Chieng ^a  

^a NATIONAL FORMOSA UNIVERSITY   (Taiwan)

Author keywords

LMC procedure; NP complete; SES heuristic; Tardiness; Worker assignment scheduling problem

Indexed keywords

ASSEMBLY; COMPUTER SIMULATION; JOB ANALYSIS; MATHEMATICAL MODELS; PRODUCTION ENGINEERING; SCHEDULING;

LARGEST MARGINAL CONTRIBUTION (LMC) PROCEDURE; NP-COMPLETE; SES HEURISTIC; TARDINESS; WORKER ASSIGNMENT SCHEDULING PROBLEM;

INDUSTRIAL ENGINEERING;

EID: 1942473649     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-003-1716-9     Document Type: Article

References (22)

1. Bruno J, Coffman EG Jr, Sethi R (1974) Scheduling independent tasks to reduce mean finishing time. Commun ACM 17(7):382-387
2. Rajaraman MK (1975) An algorithm for scheduling parallel processors. Int J Prod Res 13(5)
3. Barnes JW, Brennan JJ (1977) An improved algorithm for scheduling jobs on identical machines. AIIE Trans 9(1)
4. Du J, Leung JYH (1989) Complexity of scheduling parallel task systems. SIAM J Discrete Math 2(4):473-487
5. 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
6. Feitelson DG, Rudolph L (1992) Gang scheduling performance benefits for fine-grain synchronization. J Parallel Distributed Comput 16(4):306-318
7. Wand Q, Cheng KH (1992) A heuristic of scheduling parallel tasks and its analysis. SIAM J Comput 21(2):281-294
8. Hurink J, Knust S (2001) List scheduling in a parallel machine environment with precedence constraints and setup times. Oper Res Lett 29:231-239
9. Sprecher A, Drexl A (1998) Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm. Eur J Oper Res 107: 431-450
10. Yamada T, Nakano R (1997) Genetic algorithms for job-shop scheduling problems. In: Proceedings modern heuristic decision support, UNICOM seminar, 18-19 March 1997, London, pp 67-81
11. Sule DR, Vijayasundaram K (1998) A heuristic procedure for makespan minimisation in job shops with multiple identical processors. Comput Ind Eng 35(3-4):399-402
12. Iwamoto S (2001) Fuzzy decision-making through three dynamic programming approaches. Int J Fuzzy Syst 3(4)
13. Yamada T, Nakeno R (1990) Job-shop scheduling by simulated annealing combined with deterministic local search. Kruwei Academic, MA, pp 237-246
14. Jain AS, Meeran S (1998) Job-shop scheduling using neural networks. Int J Prod Res 36(5): 1249-1272
15. Gupta JND, Maykut AR (1973) Scheduling jobs on parallel processors with dynamic programming. Decision Sci 4(4)
16. Rothkopf MH (1966) Scheduling independent tasks on parallel processors. Manage Sci 12(5)
17. Dogramaci A, Surkis J (1979) Evaluation of a heuristic for scheduling independent jobs on parallel identical processors. Manage Sci 25(12):1208-1216
18. Baker KR (1973) Procedures for sequencing tasks with one resource type. Int J Prod Resources 11(2)
19. Baker KR (1974) introduction to sequencing and scheduling. Wiley, New York, pp 10-11
20. French S (1982) Sequencing and scheduling: an introduction to the mathematics of the job shop. Ellis Horwood, Chichester, pp 8-9
21. Hu P (1993) An efficient heuristic for the worker assignment problem in the identical and nonidentical parallel-machine models. PhD dissertation, Department of Industrial and Management Systems Engineering, Pennsylvania State University, University Park, Pennsylvania, p 2
22. Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. W.H. Freeman, New York, p 245