One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
From MaRDI portal
Cited in
(99)- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- The single-machine total tardiness scheduling problem: review and extensions
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- The two-machine flowshop scheduling problem with total tardiness
- An efficient job scheduling algorithm for mixed turnaround and deadline applications
- Hybrid algorithm for sequencing with bicriteria
- One machine scheduling to minimize expected mean tardiness. I
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- Four solution techniques for a general one machine scheduling problem. A comparative study
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- A simulated annealing approach for the one-machine mean tardiness scheduling problem
- Single-machine scheduling with time windows and earliness/tardiness penalties
- Evaluation of leading heuristics for the single machine tardiness problem
- A heuristic for the single machine tardiness problem
- One machine scheduling to minimize expected mean tardiness. II
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Decomposition of the single machine total tardiness problem
- Approximate algorithms for the \(P\parallel C_{\max}\) problem
- Generalized pairwise interchanges and machine scheduling
- A new lower bounding scheme for the total weighted tardiness problem.
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Parallel machine scheduling with a common server
- Solution of the single machine total tardiness problem
- Distributionally robust single machine scheduling with the total tardiness criterion
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
- Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Minimizing the weighted sum of squared tardiness on a single machine
- On the single machine total tardiness problem
- Scheduling a single machine to minimize a regular objective function under setup constraints
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
- A decomposition algorithm for the single machine total tardiness problem
- Finding the Pareto-optima for the total and maximum tardiness single machine problem
- Augmentations of consistent partial orders for the one-machine total tardiness problem
- Optimal sequences in stochastic single machine shops
- On decomposition of the total tardiness problem
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- Minimizing delays in a shunting yard
- \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
- A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance
- The proportionate flow shop total tardiness problem
- Single machine scheduling with nonlinear cost functions
- Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
- Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
- Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
- Minimizing total tardiness on a single machine with unequal release dates
- Minimizing total tardiness in a scheduling problem with a learning effect
- A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
- A branch and bound procedure to minimize mean absolute lateness on a single processor
- Three stage generalized flowshop: Scheduling civil engineering projects
- Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
- One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
- Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- An order scheduling problem with position-based learning effect
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Erratum: One machine sequencing to minimize total tardiness: a fourth theorem for Emmons
- Production problems with deadline penalties
- A dual algorithm for the one-machine scheduling problem
- Dominance rules in combinatorial optimization problems
- A bicriterion scheduling problem involving total flowtime and total tardiness
- Two-machine flowshop scheduling to minimize total tardiness
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem
- A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- Sequencing jobs on a single machine: A neural network approach
- Algorithmic paradoxes of the single-machine total tardiness problem
- Single machine scheduling with release times, deadlines and tardiness objectives
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- Minimizing tardiness in a two-machine flow-shop
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- Single-machine primary-secondary scheduling with total tardiness being the primary criterion
- A tabu search approach for the weighted tardiness with sequence-dependent setups in one-machine problem
- Discovering heuristics with large language models (LLMs) for mixed-integer programs: single-machine scheduling
- Modified ATCR rule for fixed and variable costs of tardiness
- Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect
- Optimal order-of-addition experiments under a prior constraint
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Domain-independent dynamic programming
- A computational evaluation of new and existing dispatching rules for the single machine total weighted tardiness problem
- Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
- A mapping-based universal kriging model for order-of-addition experiments in drug combination studies
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- Some remarks on the decomposition properties of the single machine total tardiness problem
- Order scheduling in an environment with dedicated resources in parallel
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
This page was built for publication: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5568940)