Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Chandrasekharan Rajendran
Information about the author Chandrasekharan Rajendran will soon be added to the site.
Found
39 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
2017
In this paper, we propose two new heuristic tie‐breaking rules in the...
Supply chain risk management in the Indian manufacturing context: a conceptual framework
2016
Due to emergence of global business environment, short product life cycles,...
The value of information sharing in a multi-product, multi-level supply chain: Impact of product substitution, demand correlation, and partial information sharing
2014
The literature on the value of information sharing within a supply chain is extensive....
A framework for public drug distribution system in India
2012
The present study aims to develop an instrument to measure various dimensions of the...
A genetic algorithm for solving the fixed‐charge transportation model: Two‐stage problem
2012
Transportation of goods in a supply chain from plants to customers through...
A novel particle swarm optimisation algorithm for continuous function optimisation
2012
Particle swarm optimisation (PSO) algorithms are applied in a variety of...
Optimal and heuristic base-stock levels and review periods in a serial supply chain
2010
A key issue in a Supply Chain (SC) concerns the control policy to determine the...
Scheduling in resource-constrained multiple projects to minimise the weighted tardiness and weighted earliness of projects
2010
Determination of a schedule to complete projects exactly on their assigned due-dates...
An empirical study on supply chain management: the perspective of logistics service providers
2010
A growing awareness that competitive advantage comes from the delivery process as much...
Fast heuristic algorithms to solve a single-stage Fixed-Charge Transportation Problem
2009
The Fixed-Charge Transportation Problem (FCTP) is an extension of the classical...
A two‐phase metaheuristic approach for solving Economic Lot Scheduling Problems
2009
In this paper, economic lot scheduling problem is investigated using...
Heuristic approaches to determine base-stock levels in a serial supply chain with a single objective and with multiple objectives
2006
This paper deals with the problem of determination of installation base-stock levels...
Dispatching in flowshops with bottleneck machines
2007
This paper addresses the problem of dispatching in flowshops with bottleneck machines....
A simulation-based genetic algorithm for inventory optimization in a serial supply chain
2005
One of the important aspects of supply chain management is inventory management...
Determination of base-stock levels in a serial supply chain: A simulation-based simulated annealing heuristic
2005
This paper presents simulation-based heuristic methodologies to compute installation...
A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
2005
In this paper, we consider the problem of permutation flowshop scheduling with the...
Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs
2005
In many manufacturing systems, jobs that are completed early are held as...
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops
2005
The problem of scheduling in flowshops with the objective of minimizing total flowtime...
Development and analysis of cost-based dispatching rules for job shop scheduling
2004
Most dispatching rules for job shop scheduling assume that the cost of holding per...
Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
2004
The problem of scheduling in permutation flowshops is considered with the objective of...
Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times
2003
Efficient heuristics for scheduling jobs in a static flowshop with sequence-dependent...
A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
2002
Most studies on scheduling in manufacturing systems using dispatching rules deal with...
Flowshop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
2001
We consider two problems of m -machine flowshop scheduling in this paper: one, with...
A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
2001
An experimental investigation of the performance of dispatching rules and a heuristic...
1
2
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers