Showing papers by "Chandrasekharan Rajendran published in 1997"
TL;DR: Five new dispatching rules for scheduling in a job shop are presented and it has been observed that the proposed rules are not only simple in structure, but also quite efficient in minimizing several measures of performance.
228 citations
TL;DR: In this article, a heuristic algorithm is developed by the introduction of lower bounds on the completion times of jobs and the development of heuristic preference relations for the scheduling problem under study.
168 citations
TL;DR: In this paper, a heuristic algorithm based on simulated annealing SA is developed for scheduling in a drill-bit manufacturing industry, with the objective of minimizing the mean weighted tardiness.
Abstract: The problem of scheduling in a flowshop is considered, with the objective of minimizing the mean weighted tardiness. A case study is carried out in a drill-bit manufacturing industry. The problem encountered in the present study is different from the conventional flowshop scheduling problem in that the setup times are separated from process times and are sequence-dependent. A heuristic algorithm, based on simulated annealing SA , is developed for scheduling in this flowshop. A method is presented for obtaining the initial seed sequence for the SA algorithm. A new exponential acceptance function and a new scheme for generating the neighbourhood, called the random insertion perturbation scheme RIPS , are proposed. The stopping criteria make use of the temperature value and the value of freeze counter that is determined by the number of accepted and generated sequences. The SA heuristic is evaluated against existing heuristics and the results of computational evaluation reveal that the proposed heuristic per...
66 citations
TL;DR: A heuristic algorithm that makes use of simulated annealing (SA) technique and a perturbation scheme in the SA algorithm for scheduling to minimize the maximum weighted tardiness of a job and total weighted tardsiness of jobs are presented.
53 citations
TL;DR: In this paper, two new dispatching rules for scheduling in a job shop are presented, which combine the process-time and work-content in the queue for the next operation on a job, by making use of additive and alternative approaches.
Abstract: We present two new dispatching rules for scheduling in a job shop. These rules combine the process-time and work-content in the queue for the next operation on a job, by making use of additive and alternative approaches. An extensive and rigorous simulation study has been carried out to evaluate the performance of the proposed dispatching rules compared with those by the SPT rule, the WINQ rule, a random rule based on the SPT and WINQ rules, and the best existing rule. The important aspects of the results of the experimental investigation are also discussed in detail.
40 citations
TL;DR: The problem of scheduling in a flowshop, where setup, processing and removal times are separable, is considered with the objective of minimizing makespan and heuristic algorithms are developed by the introduction of simplifying assumptions.
Abstract: The problem of scheduling in a flowshop, where setup, processing and removal times are separable, is considered with the objective of minimizing makespan. Heuristic algorithms are developed by the introduction of simplifying assumptions into the scheduling problem under study. An improvement method is incorporated in the heuristics to enhance the quality of their solutions. The proposed heuristics and an existing heuristic are evaluated by a large number of randomly generated problems. The results of an extensive computational investigation for various values of parameters are presented.
36 citations
01 Dec 1997
TL;DR: In this paper, a new heuristic to minimize the sum of weighted flowtime of jobs in a static flowshop with sequence-dependent setup times of jobs is proposed, which is computationally faster and more effective in yielding solutions of better quality than the existing heuristic.
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.
29 citations
TL;DR: Two heuristics are proposed with the twin objectives of minimizing the total weighted waitingtime of containers and total weighted flowtime of part-types and the results of computational evaluation are presented.
11 citations