Header menu link for other important links
X
Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times
Published in
2003
Volume: 149
   
Issue: 3
Pages: 513 - 522
Abstract
Efficient heuristics for scheduling jobs in a static flowshop with sequence-dependent setup times of jobs are presented in this paper. The objective is to minimize the sum of weighted flowtime and weighted tardiness of jobs. Two heuristic preference relations are used to construct a good heuristic permutation sequence of jobs. Thereafter, an improvement scheme is implemented, once and twice, on the heuristic sequence to enhance the quality of the solution. An existing heuristic, a random search procedure and a greedy local search are used as benchmark methods for relatively evaluating the proposed heuristics. An extensive performance analysis has shown that the proposed heuristics are computationally faster and more effective in yielding solutions of better quality than the benchmark procedures. © 2002 Elsevier Science B.V. All rights reserved.
About the journal
JournalEuropean Journal of Operational Research
ISSN03772217
Open AccessNo
Concepts (8)
  •  related image
    Benchmarking
  •  related image
    Heuristic methods
  •  related image
    Job analysis
  •  related image
    MACHINE SHOPS
  •  related image
    Random processes
  •  related image
    Scheduling
  •  related image
    WEIGHTED FLOWTIME
  •  related image
    Operations research