Rajendran Chandrasekharan

Chandrasekharan Rajendran

Information about the author Chandrasekharan Rajendran will soon be added to the site.
Found 39 papers in total
Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops – Part 1
Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops – Part 1
2000
In the first part of this paper, we consider a kanban-controlled flowshop and present...
Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops – Part 2
Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops – Part 2
2000
We consider the problem of determination of the number of containers or container...
Dispatching rules for scheduling in assembly jobshops – Part 1
Dispatching rules for scheduling in assembly jobshops – Part 1
2000
Research on jobshop scheduling has tended to concentrate on the development of...
Dispatching rules for scheduling in assembly jobshops – Part 2
Dispatching rules for scheduling in assembly jobshops – Part 2
2000
In this part of the paper, we present the development and evaluation of dispatching...
New dispatching rules for shop scheduling: A step forward
New dispatching rules for shop scheduling: A step forward
2000
This paper provides a set of new dispatching rules for the minimization of various...
A comparative study of dispatching rules in dynamic flowshops and jobshops
A comparative study of dispatching rules in dynamic flowshops and jobshops
1999
This paper presents a comparative study on the performance of dispatching rules in the...
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
1997
The problem of scheduling in a flowshop is considered with the objective of minimizing...
Heuristics for scheduling in a Kanban system with dual blocking mechanisms
Heuristics for scheduling in a Kanban system with dual blocking mechanisms
1997
In this paper, the problem of scheduling in a Kanban system with dual blocking...
Heuristics for scheduling in flowshop with multiple objectives
Heuristics for scheduling in flowshop with multiple objectives
1995
Most of the heuristics for flowshop scheduling aim at minimizing makespan. However,...
Efficient dispatching rules for scheduling in a job shop
Efficient dispatching rules for scheduling in a job shop
1997
We consider in this article the development of new and efficient dispatching rules...
An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs
An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs
1997
This paper deals with the development and evaluation of heuristics for scheduling in a...
Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 2
Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 2
1997
This paper is the second of two papers (see IAOR 62601) that deal with the problem of...
An efficient heuristic approach to the scheduling of jobs in a flowshop
An efficient heuristic approach to the scheduling of jobs in a flowshop
1992
Three heuristic algorithms for flowshop scheduling with the objective of minimizing...
A multi-stage parallel-processor flowshop problem with minimum flowtime
A multi-stage parallel-processor flowshop problem with minimum flowtime
1992
Most algorithms on flowshop scheduling assume that every stage has a single processor...
Scheduling in N-job, M-stage flowshop with parallel processors to minimize makespan
Scheduling in N-job, M-stage flowshop with parallel processors to minimize makespan
1992
The existing algorithms for optimizing the flowshop scheduling problem with the...
Papers per page: