Dipak Laha
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dipak Laha has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Arindam Majumder
National Institute of Technology Agartala
4 shared publications Arindam Chakravorty
Jadavpur University
2 shared publicationsArindam Majumder
1 shared publication- Dhiren Kumar Behera
Department of Mechanical Engineering, Indira Gandhi Institute of Technology, Sarang, India
1 shared publication Jatinder N.D. Gupta
1 shared publicationSagar U. Sapkal
Mechanical Engineering Department, Jadavpur University, Kolkata 700032, India
1 shared publication
Latest Publications
- 26 February 2020
- Published by Springer Nature
- p. 215-224
Bacterial Foraging Optimization in Non-identical Parallel Batch Processing Machines
- 26 February 2020
- Published by Springer Nature
- p. 215-224
Bacterial Foraging Optimization in Non-identical Parallel Batch Processing Machines
- 1 December 2018
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 126, 348-360
An improved cuckoo search algorithm for scheduling jobs on identical parallel machines
- 1 December 2018
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 126, 348-360
An improved cuckoo search algorithm for scheduling jobs on identical parallel machines
- 19 September 2018
- Published by Springer Nature
- p. 107-117
Modeling of Flow Shop Scheduling with Effective Training Algorithms-Based Neural Networks
- 19 September 2018
- Published by Springer Nature
- p. 107-117
Modeling of Flow Shop Scheduling with Effective Training Algorithms-Based Neural Networks
- 9 February 2018
- Published by Springer Nature
- p. 645-653
Cuckoo Search on Parallel Batch Processing Machines
- 9 February 2018
- Published by Springer Nature
- p. 645-653
Cuckoo Search on Parallel Batch Processing Machines
- 27 July 2017
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 93 (9-12) , 3759-3776
A heuristically directed immune algorithm to minimize makespan and total flow time in permutation flow shops
- 27 July 2017
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 93 (9-12) , 3759-3776
A heuristically directed immune algorithm to minimize makespan and total flow time in permutation flow shops
- 1 January 2017
- Published by Elsevier in Materials Today: Proceedings
- Vol. 4 (2) , 2129-2136
Bacteria Foraging Optimization Algorithm for Robotic Cell Scheduling Problem
- 1 January 2017
- Published by Elsevier in Materials Today: Proceedings
- Vol. 4 (2) , 2129-2136
Bacteria Foraging Optimization Algorithm for Robotic Cell Scheduling Problem
- 1 June 2016
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 28, 131-143
A new cuckoo search algorithm for 2-machine robotic cell scheduling problem with sequence-dependent setup times
- 1 June 2016
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 28, 131-143
A new cuckoo search algorithm for 2-machine robotic cell scheduling problem with sequence-dependent setup times
- 16 July 2015
- Published by Springer Nature
- p. 788-800
An Improved Cuckoo Search Algorithm for Parallel Machine Scheduling
- 16 July 2015
- Published by Springer Nature
- p. 788-800
An Improved Cuckoo Search Algorithm for Parallel Machine Scheduling
- 5 April 2013
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 68 (5-8) , 1327-1338
A heuristic for no-wait flow shop scheduling
- 5 April 2013
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 68 (5-8) , 1327-1338
A heuristic for no-wait flow shop scheduling
- 1 April 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 159-163
An improved scheduling heuristic algorithm for no-wait flow shops on total flow time criterion
Since the no-wait flow shop scheduling problems have been proved to be NP-hard, heuristic procedures are considered as the most suitable ones for their solution, especially for large - sized problems. We present a constructive heuristic for minimizing total flow time criterion in no-wait flow shop scheduling problems. The proposed heuristic is based on the assumption that the priority of a job in the sequence is given by the sum of its processing times on the bottleneck machine(s) for selecting the initial sequence of jobs. The final sequence is based on the principle of job insertion for minimizing the total flow time. The computational results show that the proposed heuristic significantly outperforms the existing heuristics, while not affecting its computational CPU time.
- 1 April 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 159-163
An improved scheduling heuristic algorithm for no-wait flow shops on total flow time criterion
Since the no-wait flow shop scheduling problems have been proved to be NP-hard, heuristic procedures are considered as the most suitable ones for their solution, especially for large - sized problems. We present a constructive heuristic for minimizing total flow time criterion in no-wait flow shop scheduling problems. The proposed heuristic is based on the assumption that the priority of a job in the sequence is given by the sum of its processing times on the bottleneck machine(s) for selecting the initial sequence of jobs. The final sequence is based on the principle of job insertion for minimizing the total flow time. The computational results show that the proposed heuristic significantly outperforms the existing heuristics, while not affecting its computational CPU time.