Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • Research Outputs
  • Fundings & Projects
  • People
  • Statistics
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Indian Institute of Technology Madras
  3. Publication11
  4. A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs
 
  • Details
Options

A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs

Date Issued
01-01-1997
Author(s)
C Rajendran 
Indian Institute of Technology, Madras
Ziegler, H.
DOI
10.1016/s0360-8352(97)00093-4
Abstract
The problem of scheduling in a static flowshop with sequence-dependent setup times of jobs (FSDS) is considered in this paper. A new heuristic to minimize the sum of weighted flowtime of jobs in a FSDS is proposed. An improvement scheme is supplemented to enhance the quality of the heuristic solution. An extensive computational performance analysis has shown that the proposed heuristic is computationally faster and more effective in yielding solutions of better quality than the existing heuristic. An interesting observation is that even though the proposed heuristic aims to minimize the sum of weighted flowtime of jobs (just like the existing heuristic), it fares much better than the existing heuristic in minimizing the maximum weighted flowtime of a job too. © 1997 Elsevier Science Ltd.
Volume
33
Subjects
  • Flowshop

  • Heuristics

  • Scheduling

  • Sequence-dependent se...

  • Weighted flowtime

Indian Institute of Technology Madras Knowledge Repository developed and maintained by the Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback