A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
DOI10.3934/naco.2017029zbMath1377.90025OpenAlexW2766832755MaRDI QIDQ1686431
Hamed Davari Ardakani, Mostafa Abouei Ardakan, A. Kourank Beheshti, S. Hamid Mirmohammadi
Publication date: 22 December 2017
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2017029
number of tardy jobsdynamic two-machine flow shophybrid meta-heuristic algorithmparallel simulated annealing-genetic algorithm
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- An improved annealing scheme for the QAP
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
- Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
- Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- Minimizing total tardiness on a two-machine re-entrant flowshop
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A new rule for minimizing the number of tardy jobs in dynamic flow shops
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Convergence of an annealing algorithm
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
This page was built for publication: A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
