The Single Machine Early/Tardy Problem

DOI10.1287/MNSC.35.2.177MaRDI QIDQ3818793zbMATH OpenOpenAlexFDO

Authors Peng Ow Si, Thomas E. Morton

Publication date 1989

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/77824f5c221ac01a66d72170857300a5770c6cfb

zbMATH Keywords

single machinecomputational studyfiltered beam searchnear-optimal solutionsdispatch priority rulestotal early and tardy costs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the single machine total tardiness problem
• Solution of the single machine total tardiness problem
• The one-machine problem with earliness and tardiness penalties
• Single machine earliness and tardiness scheduling
• A heuristic for the single machine tardiness problem
• Insights into two solution procedures for the single machine tardiness problem
• New insights on the single machine total tardiness problem
• scientific article; zbMATH DE number 1076139
• Decomposition of the single machine total tardiness problem
• Single machine scheduling to minimize the number of early and tardy jobs

Cited in

(68)

• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
• Counting and enumeration complexity with application to multicriteria scheduling
• Scheduling just-in-time part supply for mixed-model assembly lines
• Just-in-time scheduling problem with affine idleness cost
• EA/G-GA for single machine scheduling problems with earliness/tardiness costs
• A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
• Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
• A simulation-based scheduler for flexible flowlines
• Minimizing earliness and tardiness costs in stochastic scheduling
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
• Single CNC machine scheduling with controllable processing times and multiple due dates
• Insertion techniques for the heuristic solution of the job shop problem
• Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics
• On solving permutation scheduling problems with ant colony optimization
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
• Minmax scheduling with job-classes and earliness-tardiness costs
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• Single-machine scheduling with time windows and earliness/tardiness penalties
• On the flexibility of a decision theory-based heuristic for single machine scheduling
• A heuristic for single machine scheduling with early and tardy costs
• An exact approach to early/tardy scheduling with release dates
• Focused simulated annealing search: An application to job shop scheduling
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Single machine scheduling with symmetric earliness and tardiness penalties
• A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
• Improved heuristics for the early/tardy scheduling problem with no idle time
• Performance enhancements to tabu search for the early/tardy scheduling problem
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
• Job sequencing and due date assignment in a single machine shop with uncertain processing times
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
• Insights into two solution procedures for the single machine tardiness problem
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• A composite heuristic for the single machine early/tardy job scheduling problem.
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
• Order acceptance with weighted tardiness
• Scheduling unrelated parallel machines with sequence-dependent setups
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders
• Scheduling two parallel semiautomatic machines to minimize machine interference
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
• A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
• A comparison of lower bounds for the single-machine early/tardy problem
• Genetic search with dynamic operating disciplines
• Multicriteria scheduling problems: a survey
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
• Single machine earliness and tardiness scheduling
• Minimizing the earliness--tardiness costs on a single machine
• A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date
• The stochastic single machine scheduling problem with earliness and tardiness costs
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
• Extended beam search for non-exhaustive state space analysis
• A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM
• Machine scheduling with earliness, tardiness and non-execution penalties
• Heuristics for permutation flow shop scheduling with batch setup times
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Simulated annealing algorithm for solving the single machine early/tardy problem
• Modified ATCR rule for fixed and variable costs of tardiness
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• Algorithm for minimizing weighted earliness penalty in single-machine problem
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness

This page was built for publication: The Single Machine Early/Tardy Problem

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