Single Machine Scheduling to Minimize Weighted Sum of Completion Times Added with the Maximum Tardiness - A Branch and Bound Approach

Volume 8 , Issue 1 , December 2005 , Pages 141-145

Authors

Ayda M. Ramadan 1

1 College of Medicine, University of Sulaimani

DOI logo 10.17656/jzs.10142

Keywords

Abstract

This paper considers the problem of scheduling n jobs on a single machine to minimize total weighted completion times and the maximum tardiness .A branch and bound algorithm is proposed to find ootimal 

schedule. Our lower bound based on the late and early jobs. Computational experience on problems with to 60 jobs for a special case and 50 jobs for a general case, where {he previous works solve the problem up to 50 and 40 jobs for special and general case respectively .This indicates that the proposed al gorithm is superior to other known algorithms .

Statistics
  • Article view367
  • Downloads1
  • Published at1 December 2005

  • RIS
  • BibTeX
  • EndNote
  • Mendeley
  • APA (7th edition)
  • MLA (9th edition)
  • Chicago
  • Harvard
  • IEEE
  • Vancouver