The Single Machine Early/Tardy Problem

DOI10.1287/mnsc.35.2.177zbMath0666.90043OpenAlexW2160577943MaRDI QIDQ3818793

Thomas E. Morton, Peng Ow Si

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

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

Related Items (65)

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

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