Single machine earliness and tardiness scheduling

DOI10.1016/S0377-2217(96)00062-8zbMath0917.90194MaRDI QIDQ1278531

George Li

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationbranch-and-boundsingle machineheuristicsubgradient optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling jobs and maintenance activities on parallel machines, Improved heuristics for the early/tardy scheduling problem with no idle time, A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties, Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties, A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties, Minimizing total earliness and tardiness on a single machine using a hybrid heuristic, 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, Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders, Incremental beam search, Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness, Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties, Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties, Scheduling just-in-time part supply for mixed-model assembly lines, An exact approach to early/tardy scheduling with release dates, Design of predictable production scheduling model using control theoretic approach, Modeling single machine preemptive scheduling problems for computational efficiency, Counting and enumeration complexity with application to multicriteria scheduling, Anytime pack search, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, Minimizing earliness and tardiness costs in stochastic scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• The stochastic single machine scheduling problem with earliness and tardiness costs
• A decomposition algorithm for the single machine total tardiness problem
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Sequencing with Earliness and Tardiness Penalties: A Review
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Single Machine Early/Tardy Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Minimizing Total Costs in One-Machine Scheduling
• A dual algorithm for the one-machine scheduling problem
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Validation of subgradient optimization