One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

DOI10.1287/opre.17.4.701zbMath0176.50005OpenAlexW2007518229MaRDI QIDQ5568940

Hamilton Emmons

Publication date: 1969

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.17.4.701

zbMATH Keywords

operations research

Related Items

One machine scheduling to minimize expected mean tardiness. II ⋮ The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ A mapping-based universal kriging model for order-of-addition experiments in drug combination studies ⋮ Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions ⋮ 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 ⋮ A bicriterion scheduling problem involving total flowtime and total tardiness ⋮ Dynamic programming and decomposition approaches for the single machine total tardiness problem ⋮ A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem ⋮ Erratum—One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons ⋮ A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance ⋮ 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 ⋮ Some remarks on the decomposition properties of the single machine total tardiness problem ⋮ Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach ⋮ 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 ⋮ Decomposition of the single machine total tardiness problem ⋮ An order scheduling problem with position-based learning effect ⋮ Production problems with deadline penalties ⋮ Approximate algorithms for the \(P\parallel C_{\max}\) problem ⋮ The two-machine flowshop scheduling problem with total tardiness ⋮ A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates ⋮ Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times ⋮ Augmentations of consistent partial orders for the one-machine total tardiness problem ⋮ Optimal sequences in stochastic single machine shops ⋮ The proportionate flow shop 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 ⋮ On decomposition of the total tardiness problem ⋮ Generalized pairwise interchanges and machine scheduling ⋮ An efficient job scheduling algorithm for mixed turnaround and deadline applications ⋮ New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives ⋮ Dominance rules in combinatorial optimization problems ⋮ A new lower bounding scheme for the total weighted tardiness problem. ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Scheduling unrelated parallel machines to minimize total weighted tardiness. ⋮ Hybrid algorithm for sequencing with bicriteria ⋮ A controlled search simulated annealing method for the single machine weighted tardiness problem ⋮ A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization ⋮ Two-machine flowshop scheduling to minimize total tardiness ⋮ Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ One machine scheduling to minimize expected mean tardiness. I ⋮ Minimizing total tardiness on a single machine with unequal release dates ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects ⋮ Minimizing total tardiness in a scheduling problem with a learning effect ⋮ Precedence theorems and dynamic programming for the single-machine weighted tardiness problem ⋮ Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem ⋮ Sequencing jobs on a single machine: A neural network approach ⋮ Minimizing the weighted sum of squared tardiness on a single machine ⋮ Algorithmic paradoxes of the single-machine total tardiness problem ⋮ A dual algorithm for the one-machine scheduling problem ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert ⋮ On the single machine total tardiness problem ⋮ Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment ⋮ Minimizing delays in a shunting yard ⋮ Single machine scheduling with release times, deadlines and tardiness objectives ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ A new dominance rule to minimize total weighted tardiness with unequal release dates. ⋮ Single machine scheduling with nonlinear cost functions ⋮ \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees ⋮ An exact exponential branch-and-merge algorithm for the single machine total tardiness problem ⋮ Minimizing tardiness in a two-machine flow-shop ⋮ Four solution techniques for a general one machine scheduling problem. A comparative study ⋮ 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 ⋮ 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 ⋮ Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem ⋮ Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints ⋮ 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 ⋮ Scheduling jobs with agreeable processing times and due dates on a single batch processing machine ⋮ Single-machine scheduling with time windows and earliness/tardiness penalties ⋮ Evaluation of leading heuristics for the single machine tardiness problem ⋮ Parallel machine scheduling with a common server ⋮ The single-machine total tardiness scheduling problem: review and extensions ⋮ A branch and bound procedure to minimize mean absolute lateness on a single processor ⋮ Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem ⋮ Three stage generalized flowshop: Scheduling civil engineering projects ⋮ A decomposition algorithm for the single machine total tardiness problem ⋮ Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert ⋮ Finding the Pareto-optima for the total and maximum tardiness single machine problem ⋮ Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem ⋮ Solution of the single machine total tardiness problem ⋮ A heuristic for the single machine tardiness problem ⋮ One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons ⋮ An exact algorithm for the precedence-constrained single-machine scheduling problem