The Total Tardiness Problem: Review and Extensions
From MaRDI portal
Recommendations
- The single-machine total tardiness scheduling problem: review and extensions
- On the single machine total tardiness problem
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- The two-machine flowshop scheduling problem with total tardiness
Cited in
(70)- Minimizing total tardiness on a single machine with controllable processing times
- The single-machine total tardiness scheduling problem: review and extensions
- Minimizing total tardiness on a two-machine re-entrant flowshop
- On minimizing the sum of k tardinesses
- A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem
- Single-machine scheduling with time windows and earliness/tardiness penalties
- A note on the equivalence of two heuristics to minimize total tardiness
- The job shop tardiness problem: A corrected model
- Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- `Aversion dynamics' scheduling when the system changes
- Solution of the single machine total tardiness problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A comprehensive review of flowshop group scheduling literature
- Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
- A tabu search algorithm for parallel machine total tardiness problem
- On the single machine total tardiness problem
- Optimal and heuristic solutions for a scheduling problem arising in a foundry
- A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
- Match-up scheduling under a machine breakdown
- New heuristics for total tardiness minimization in a flexible flowshop
- Scheduling with divisible jobs and subcontracting option
- Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems
- A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- Flow shops with reentry: reversibility properties and makespan optimal schedules
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- A metric for total tardiness minimization
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Note on minimizing total tardiness in a two-machine flowshop
- Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- The single-machine total tardiness problem with unequal release times and a linear deterioration
- Pricing and scheduling decisions with leadtime flexibility
- Quantifying the impact of sharing resources in a collaborative warehouse
- Permutation flow shop scheduling with earliness and tardiness penalties
- A multiobjective optimization approach to solve a parallel machines scheduling problem
- An assignment-based lower bound for a class of two-machine flow shop problems
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms
- Acquisition planning and scheduling of computing resources
- Minimizing the average tardiness: the case of outsource machines
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- Bottleneck-focused scheduling for a hybrid flowshop
- scientific article; zbMATH DE number 1541306 (Why is no real title available?)
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
- The joint load balancing and parallel machine scheduling problem
- Sequencing jobs on a single machine: A neural network approach
- A memetic algorithm for the total tardiness single machine scheduling problem
- Greedy solutions of selection and ordering problems
- Single machine scheduling with release times, deadlines and tardiness objectives
- Algorithms for a two‐machine flowshop problem with jobs of two classes
- Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
- Tail probability estimates of continuous-time simulated annealing processes
- INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
- Discrete-time simulated annealing: a convergence analysis via the Eyring-Kramers law
- Lagrangian relaxation for seru scheduling problem with a time-dependent learning effect
- Modified ATCR rule for fixed and variable costs of tardiness
- State-dependent machine availability in scheduling
- Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
- A tabu search algorithm for the single machine total weighted tardiness problem
- Scheduling on parallel identical machines to minimize total tardiness
- A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
- Scheduling unrelated parallel machines with sequence-dependent setups
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
This page was built for publication: The Total Tardiness Problem: Review and Extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834060)
