A simulated annealing approach for the one-machine mean tardiness scheduling problem
From MaRDI portal
(Redirected from Publication:1268192)
Recommendations
- Simulated annealing algorithm for solving the single machine early/tardy problem
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- scientific article; zbMATH DE number 906534
- A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
- A tabu search approach for the single machine mean tardiness problem
- A simulated annealing approach to bicriteria scheduling problems on a single machine
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
- A simulated annealing algorithm for single machine scheduling problems with family setups
- Solving Scheduling Problems by Simulated Annealing
Cites work
- A decomposition algorithm for the single machine total tardiness problem
- A dual algorithm for the one-machine scheduling problem
- A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
- scientific article; zbMATH DE number 4085401 (Why is no real title available?)
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- Minimizing Total Tardiness on One Machine is NP-Hard
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Optimization by simulated annealing
Cited in
(21)- Minimizing total tardiness on a single machine with controllable processing times
- The single-machine total tardiness scheduling problem: review and extensions
- A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
- An SA/TS mixture algorithm for the scheduling tardiness problem
- A semi-infinite programming model for earliness/tardiness production planning with simulated annealing
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- Formulating and solving production planning problems
- A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
- Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates
- A simulated annealing approach to bicriteria scheduling problems on a single machine
- Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
- A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
- A tabu search approach for the single machine mean tardiness problem
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
- A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
- scientific article; zbMATH DE number 906534 (Why is no real title available?)
- Simulated annealing algorithm for solving the single machine early/tardy problem
- Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
- A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
- Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
- A controlled search simulated annealing method for the single machine weighted tardiness problem
This page was built for publication: A simulated annealing approach for the one-machine mean tardiness scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268192)
