scientific article; zbMATH DE number 3550186

Cited in

(only showing first 100 items - show all)

A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
A population-based variable neighborhood search for the single machine total weighted tardiness problem
Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
The single-machine total tardiness scheduling problem: review and extensions
A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
Non-approximability of just-in-time scheduling
Dynamic programming and decomposition approaches for the single machine total tardiness problem
Complexity results for scheduling chains on a single machine
On the complexity of generalized due date scheduling problems
Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
A polynomial algorithm for an integer quadratic non-separable transportation problem
A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem
A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems
Scheduling jobs on parallel machines with sequence-dependent setup times
A note on the equivalence of two heuristics to minimize total tardiness
Evaluation of leading heuristics for the single machine tardiness problem
Single machine earliness and tardiness scheduling
Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
A heuristic for the single machine tardiness problem
A greedy heuristic for the mean tardiness sequencing problem
Decomposition of the single machine total tardiness problem
Scheduling parallel machines to minimize total weighted and unweighted tardiness
General stochastic single-machine scheduling with regular cost functions
Is a unit-job shop not easier than identical parallel machines?
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
A new lower bounding scheme for the total weighted tardiness problem.
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
Parallel machine scheduling with a common server
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
Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs
An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands
Scheduling with time-dependent discrepancy times
How unsplittable-flow-covering helps scheduling with job-dependent cost functions
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
An exact approach for scheduling jobs with regular step cost functions on a single machine
The single-machine total weighted tardiness scheduling problem with position-based learning effects
A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
A tabu search algorithm for parallel machine total tardiness problem
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
On the single machine total tardiness problem
Single machine scheduling to minimize total weighted tardiness
Scheduling a single machine to minimize a regular objective function under setup constraints
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
Parameterized complexity of machine scheduling: 15 open problems
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
A decomposition algorithm for the single machine total tardiness problem
A fully polynomial approximation scheme for the total tardiness problem
Finding the Pareto-optima for the total and maximum tardiness single machine problem
Minimizing total weighted tardiness on a single batch process machine with incompatible job families
A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling
Improving the complexities of approximation algorithms for optimization problems
Improving local search heuristics for some scheduling problems. I
On decomposition of the total tardiness problem
A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
Truck scheduling in cross-docking terminals with fixed outbound departures
A special case of the single-machine total tardiness problem is NP-hard
Decomposition algorithm to minimize total tardiness
Minimizing functions of infeasibilities in a two-machine flow shop
Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
A note on competing-agent Pareto-scheduling
Complexities of some problems on multi-agent scheduling on a single machine
\textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
Metric approach for finding approximate solutions of scheduling problems
New results for scheduling to minimize tardiness on one machine with rejection and related problems
Order assignment and scheduling under processing and distribution time uncertainty
Moderate exponential-time algorithms for scheduling problems
A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Modeling and solving the waste valorization production and distribution scheduling problem
Minsum scheduling with acceptable lead-times and optional job rejection
Rescheduling problems with allowing for the unexpected new jobs arrival
Single workgroup scheduling problem with variable processing personnel
The proportionate flow shop total tardiness problem
Single machine scheduling with nonlinear cost functions
Risk-averse single machine scheduling: complexity and approximation
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
Scheduling with release dates and preemption to minimize multiple max-form objective functions
A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
An exact algorithm for the precedence-constrained single-machine scheduling problem
A metric for total tardiness minimization
Scheduling with monotonous earliness and tardiness penalties
Approximation algorithms for minimizing the total weighted tardiness on a single machine
A survey of scheduling with controllable processing times
A note on the complexity of the problem of two-agent scheduling on a single machine
Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
Single machine scheduling with controllable release and processing parameters
Minimizing total tardiness on parallel machines with preemptions
Minimizing total tardiness on a single machine with unequal release dates
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Minimizing total tardiness in a scheduling problem with a learning effect

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124332)