A study on the enhanced best performance algorithm for the just-in-time scheduling problem
From MaRDI portal
Publication:1723298
DOI10.1155/2015/350308zbMath1418.90107OpenAlexW2032697704WikidataQ59105832 ScholiaQ59105832MaRDI QIDQ1723298
Sivashan Chetty, Aderemi O. Adewumi
Publication date: 19 February 2019
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/350308
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
- Genetic algorithms for supply-chain scheduling: a case study in the distribution of ready-mixed concrete
- A multi-level genetic algorithm for a multi-stage space allocation problem
- Three new stochastic local search metaheuristics for the Annual Crop Planning problem based on a new Irrigation Scheme
- Three new stochastic local search algorithms for continuous optimization problems
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
This page was built for publication: A study on the enhanced best performance algorithm for the just-in-time scheduling problem