Gajendra Kumar Adil

Orcid: 0000-0002-8412-8268

According to our database1, Gajendra Kumar Adil authored at least 16 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Development of an open-source data-driven simulator for the unit-load multi-aisle automated storage and retrieval systems.
J. Simulation, March, 2024

2023
An Accelerated Dynamic Programming Algorithm for Storage Class Formation in Unit Load Warehouses with Considerations of Space Sharing.
Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2023

2021
Designing an automated storage/retrieval system with a single aisle-mobile crane under three new turnover based storage policies.
Int. J. Comput. Integr. Manuf., 2021

2020
Case - Forward-Reserve Storage Design: A Case of Carriage Repair Workshop, Indian Railways.
INFORMS Trans. Educ., 2020

Case Article - Forward-Reserve Storage Design: A Case of Carriage Repair Workshop, Indian Railways.
INFORMS Trans. Educ., 2020

2019
Designing a block stacked warehouse for dynamic and stochastic product flow: a scenario-based robust approach.
Int. J. Prod. Res., 2019

A flexible approach to designing a single crane, multi-aisle automated storage/retrieval system considering storage policies, transport equipment and demand skew.
Int. J. Comput. Integr. Manuf., 2019

2017
Analytical models for a new turnover-based hybrid storage policy in unit-load warehouses.
Int. J. Prod. Res., 2017

2014
Class-Based Storage Assignment in a Unit-Load Warehouse Employing AS/RS with Inventory Space Allocation Considering Product Specific Setup to Holding Cost Ratio.
Asia Pac. J. Oper. Res., 2014

2011
A Dynamic Programming Heuristic for Retail Shelf Space Allocation Problem.
Asia Pac. J. Oper. Res., 2011

2010
A review of methodologies for class-based storage location assignment in a warehouse.
Int. J. Adv. Oper. Manag., 2010

A piecewise linearization for retail shelf space allocation problem and a local search heuristic.
Ann. Oper. Res., 2010

2008
A branch and bound algorithm for class based storage location assignment.
Eur. J. Oper. Res., 2008

2005
Maximum diversity/similarity models with extension to part grouping.
Int. Trans. Oper. Res., 2005

1999
Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem.
Oper. Res., 1999

1996
An equipment replacement problem with dynamic production planning and capacity considerations.
Int. J. Syst. Sci., 1996


  Loading...