Single machine earliness and tardiness scheduling
type: Item
instance of: scholarly article
title: Single machine earliness and tardiness scheduling
zbMATH Open document ID: 0917.90194
DOI: 10.1016/S0377-2217(96)00062-8
author: George Li
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1253029
zbMATH Keywords: single machine
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: subgradient optimization
zbMATH Keywords: branch-and-bound
zbMATH Keywords: heuristic
MaRDI profile type: Publication
cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Q4139967
cites work: A dual algorithm for the one-machine scheduling problem
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4178782
cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time
cites work: Validation of subgradient optimization
cites work: Q4142699
cites work: Q4124332
cites work: Q4055377
cites work: The Single Machine Early/Tardy Problem
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
cites work: Minimizing Total Costs in One-Machine Scheduling
cites work: Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
cites work: The stochastic single machine scheduling problem with earliness and tardiness costs
cites work: Algorithms for a class of single-machine weighted tardiness and earliness problems
description: scientific article; zbMATH DE number 1253029