Minimizing Total Tardiness on One Machine is NP-Hard
From MaRDI portal
Recommendations
- Solution of the NP-hard total tardiness minimization problem in scheduling theory
- Minimizing Total Tardiness on a Single Machine with Precedence Constraints
- scientific article; zbMATH DE number 4172724
- A special case of the single-machine total tardiness problem is NP-hard
- Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
Cited in
(only showing first 100 items - show all)- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
- Robust scheduling for minimizing maximum lateness on a serial-batch processing machine
- A note on reverse scheduling with maximum lateness objective
- Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm
- SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Modeling and solving the waste valorization production and distribution scheduling problem
- Minimizing total tardiness on parallel machines with preemptions
- Minimizing value-at-risk in single-machine scheduling
- Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine
- Single machine scheduling problems with financial resource constraints: some complexity results and properties
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
- Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
- Sequencing jobs on a single machine: A neural network approach
- Scheduling with time-dependent discrepancy times
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- Finding the Pareto-optima for the total and maximum tardiness single machine problem
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- Scheduling orders for multiple product types with due date related objectives
- A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness
- Single-machine primary-secondary scheduling with total tardiness being the primary criterion
- Scheduling preemptive open shops to minimize total tardiness
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- Multitasking via alternate and shared processing: algorithms and complexity
- A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem
- Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- General stochastic single-machine scheduling with regular cost functions
- Single-machine scheduling under the job rejection constraint
- Scheduling lower bounds via AND subset sum
- Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
- On the complexity of preemptive openshop scheduling problems
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
- A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling
- Minimizing total tardiness in a scheduling problem with a learning effect
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Minimizing delays in a shunting yard
- Distributionally robust single machine scheduling with the total tardiness criterion
- scientific article; zbMATH DE number 4154198 (Why is no real title available?)
- Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints
- A possibilistic approach to sequencing problems with fuzzy parameters
- scientific article; zbMATH DE number 4172724 (Why is no real title available?)
- The complexity of scheduling starting time dependent tasks with release times
- Mathematical programming formulations for machine scheduling: A survey
- The coordination of scheduling and batch deliveries
- A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
- An exact parallel method for a bi-objective permutation flowshop problem
- Evaluation of leading heuristics for the single machine tardiness problem
- Optimal and heuristic solutions for a scheduling problem arising in a foundry
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- Minimizing the number of late jobs when the start time of the machine is variable
- A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
- A simulated annealing approach for the one-machine mean tardiness scheduling problem
- Is a unit-job shop not easier than identical parallel machines?
- A decomposition scheme for single stage scheduling problems
- \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
- Scheduling two-machine preemptive open shops to minimize total completion time
- A genetic algorithm methodology for complex scheduling problems
- Minimizing total late work on a single machine with generalized due-dates
- Risk-averse single machine scheduling: complexity and approximation
- Minimizing functions of infeasibilities in a two-machine flow shop
- Complexity of two dual criteria scheduling problems
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- Complexity of single machine, multi-criteria scheduling problems
- The parcel hub scheduling problem with limited conveyor capacity and controllable unloading speeds
- Order acceptance and scheduling with delivery under generalized parameters
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
- A note on scheduling problems with competing agents and earliness minimization objectives
- On the single machine total tardiness problem
- Optimal due date assignment in multi-machine scheduling environments
- Heuristic factory planning algorithm for advanced planning and scheduling
- A metric for total tardiness minimization
- A neural network model for scheduling problems
- Improving the anytime behavior of two-phase local search
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
- Fabrication scheduling on a single machine with due date constraints
- Large-scale storage/retrieval requests sorting algorithm for multi-I/O depots automated storage/retrieval systems
- A GRASP based on DE to solve single machine scheduling problem with SDST
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
- Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution
- A parallel multiple reference point approach for multi-objective optimization
- Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption
- General variable neighborhood search for the order batching and sequencing problem
- Single machine group scheduling with family setups to minimize total tardiness
- A special case of the single-machine total tardiness problem is NP-hard
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
This page was built for publication: Minimizing Total Tardiness on One Machine is NP-Hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200872)
