A simulated annealing approach for the one-machine mean tardiness scheduling problem
From MaRDI portal
Publication:1268192
DOI10.1016/0377-2217(95)00149-2zbMath0912.90171OpenAlexW2093811690MaRDI QIDQ1268192
Publication date: 18 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00149-2
Related Items (10)
Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness ⋮ Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert ⋮ A simulated annealing approach to minimize the maximum lateness on uniform parallel machines ⋮ Minimizing total tardiness on a single machine with controllable processing times ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ Formulating and solving production planning problems ⋮ The single-machine total tardiness scheduling problem: review and extensions ⋮ Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert ⋮ Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
Cites Work
- Optimization by Simulated Annealing
- A decomposition algorithm for the single machine total tardiness problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
- A dual algorithm for the one-machine scheduling problem
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Unnamed Item
- Unnamed Item
This page was built for publication: A simulated annealing approach for the one-machine mean tardiness scheduling problem
