Skip to main content
SpringerLink
Log in

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

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Previously, minimizing total flow time in the model of an identical, parallel machines with nonpreemptive jobs has been investigated. Because the specific problem has been shown as NP-complete, heuristics have been developed for solving it. A shortest processing time for Ai part (SPT-A) heuristic is used for the job scheduling subproblem. In addition, the largest marginal contribution (LMC) procedure is used for the worker assignment subproblem and then minimizes the total flow time. Different values of W (number of workers) are used for further study of the performance of these heuristics developed. In conclusion, for the simplified processing time function, values of W have no significant influence when the heuristics are applied. In other words, no matter what value of W was used when SPT rule was applied, the heuristics generate the same, excellent results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gupta JND, Maykut AR (1973) Scheduling jobs on parallel processors with dynamic programming. Decis Sci 4(4):447–457

    Article  Google Scholar 

  2. Dogramaci A, Surkis J (1979) Evaluation of a heuristic for scheduling independent jobs on parallel identical processors. Manage Sci 25(12):1208–1216

    Article  MATH  Google Scholar 

  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

    Article  MATH  MathSciNet  Google Scholar 

  4. Sule 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

    Google Scholar 

  5. Alon N, Azar Y, Woeginger GJ, Yadid T (1998) Approximation schemes for scheduling on parallel machines. J Sched 1(1):55–66

    Article  MATH  MathSciNet  Google Scholar 

  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

    Article  MATH  Google Scholar 

  7. Webster S (1993) Bounds and asymptotic results for the uniform parallel processor weighted flow time problem. Oper Res Lett 14:85–90

    Article  MATH  MathSciNet  Google Scholar 

  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

    Article  Google Scholar 

  9. Webster S (1995) Weighted flow time bounds for scheduling identical processors. Eur J Oper Res 80:103–111

    Article  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  11. Rothkopf MH (1966) Scheduling independent tasks on parallel processors. Manage Sci 12(5):437–447

    Article  MathSciNet  Google Scholar 

  12. Du J, Leung JY-H (1989) Complexity of scheduling parallel task systems. SIAM J Discret Math 2(4):473–487

    Article  MATH  Google Scholar 

  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

    Article  Google Scholar 

  14. Wand Q, Cheng KH (1992) A heuristic of scheduling parallel tasks and its analysis. SIAM J Comput 21(2):281–294

    Article  MathSciNet  Google Scholar 

  15. Cheng TCE, Kovalyov M (2000) Parallel machine batching and scheduling with deadlines. J Sched 3(2):109–123

    Article  MATH  MathSciNet  Google Scholar 

  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)

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Management, National Formosa University, Yunlin, Taiwan, 632

    Po-Chieng Hu

Authors
  1. Po-Chieng Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Po-Chieng Hu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, PC. Further study of minimizing total flowtime for the worker assignment scheduling problem in the identical parallel-machine models. Int J Adv Manuf Technol 29, 753–757 (2006). https://doi.org/10.1007/s00170-005-2555-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-005-2555-7

Keywords

Search

Navigation