Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
From MaRDI portal
(Redirected from Publication:878591)
Recommendations
- A heuristic for single machine scheduling with early and tardy costs
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
Cites work
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A branch and bound approach for single machine scheduling with earliness and tardiness penalties
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- A composite heuristic for the single machine early/tardy job scheduling problem.
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
- A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
- A time indexed formulation of non-preemptive single machine scheduling problems
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
- Improved lower bounds for the early/tardy scheduling problem with no idle time
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- Minimizing the average deviation of job completion times about a common due date
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Optimal timing of a sequence of tasks with general completion costs
- Scheduling about a given common due date to minimize mean squared deviation of completion times
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine earliness and tardiness scheduling
- Single machine scheduling with symmetric earliness and tardiness penalties
- Single machine weighted earliness-tardiness penalty problem with a common due date
- Single-machine scheduling with early and tardy completion costs
- The Single Machine Early/Tardy Problem
- The one-machine problem with earliness and tardiness penalties
- The weighted common due date single machine scheduling problem revisited
Cited in
(25)- An uncertain parallel machine problem with deterioration and learning effect
- RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
- Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
- A meta-raps for the early/tardy single machine scheduling problem
- Order acceptance using genetic algorithms
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
- Minimizing earliness and tardiness costs in stochastic scheduling
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
- An uncertain programming model for single machine scheduling problem with batch delivery
- Self-adaptive biased differential evolution for scheduling against common due dates
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
- Minimizing the sum of job earliness and tardiness in a multimachine system
- Bi-objective single machine scheduling problem with stochastic processing times
- Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates
- A note on the equivalence of two heuristics to minimize total tardiness
- Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
- Minimizing the earliness--tardiness costs on a single machine
- STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
This page was built for publication: Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878591)
