Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem
DOI10.3934/jimo.2023093OpenAlexW4385060435MaRDI QIDQ6065188
Divya Shrivastava, Aseem Mishra
Publication date: 11 December 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2023093
makespan minimizationpermutation flow shop schedulinghybrid iterated greedy based Jaya algorithm (HIJG)
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Operations research and management science (90Bxx) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10) Computational methods for problems pertaining to combinatorics (05-08)
Cites Work
- Supply chain management in forestry -- case studies at Södra cell AB
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
- Hybrid bat algorithm for flow shop scheduling problems
- Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
- Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- Flowshop scheduling research after five decades
- Optimal two- and three-stage production schedules with setup times included
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Ordonnancements à contraintes disjonctives
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Flowshop-scheduling problems with makespan criterion: a review
- Variable neighborhood search: Principles and applications
This page was built for publication: Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem
