Dipak Laha

Orcid: 0000-0002-8216-6869

According to our database1, Dipak Laha authored at least 20 papers between 2007 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient clustering-based constructive heuristics for capacitated vehicle routing.
Int. J. Math. Oper. Res., 2024

2020
Flowshop scheduling with artificial neural networks.
J. Oper. Res. Soc., 2020

2019
Bacterial foraging optimization algorithm in robotic cells with sequence-dependent setup times.
Knowl. Based Syst., 2019

2018
A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times.
Comput. Ind. Eng., 2018

An improved cuckoo search algorithm for scheduling jobs on identical parallel machines.
Comput. Ind. Eng., 2018

2017
A comprehensive review and evaluation of LPT, MULTIFIT, COMBINE and LISTFIT for scheduling identical parallel machines.
Int. J. Inf. Commun. Technol., 2017

2016
A new cuckoo search algorithm for 2-machine robotic cell scheduling problem with sequence-dependent setup times.
Swarm Evol. Comput., 2016

A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops.
Comput. Ind. Eng., 2016

2015
Modeling of steelmaking process with effective machine learning techniques.
Expert Syst. Appl., 2015

2014
A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops.
J. Oper. Res. Soc., 2014

An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop.
Comput. Ind. Eng., 2014

An Improved Cuckoo Search Algorithm for Parallel Machine Scheduling.
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2014

2013
ANN Modeling of a Steelmaking Process.
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2013

A Hybrid Algorithm for the Permutation Flow Shop Scheduling Problem.
Proceedings of the Pattern Recognition and Machine Intelligence, 2013

Improved Flow Shop Schedules with Total Completion Time Criterion.
Proceedings of the Computational Science and Its Applications - ICCSA 2013, 2013

2012
A Simulated Annealing Heuristic for Minimizing Makespan in Parallel Machine Scheduling.
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2012

2010
Minimising total flow time in permutation flow shop scheduling using a simulated annealing-based approach.
Int. J. Autom. Control., 2010

2007
An improved heuristic for permutation flowshop scheduling.
Int. J. Inf. Commun. Technol., 2007

An efficient stochastic hybrid heuristic for flowshop scheduling.
Eng. Appl. Artif. Intell., 2007

A Constructive Heuristic for No-wait Flowshop Scheduling.
Proceedings of the 3rd Indian International Conference on Artificial Intelligence, 2007


  Loading...