A survey of algorithms for the single machine total weighted tardiness scheduling problem
type: Item
instance of: scholarly article
title: A survey of algorithms for the single machine total weighted tardiness scheduling problem
zbMATH Open document ID: 0685.90059
DOI: 10.1016/0166-218X(90)90103-J
author: T. S. Abdul-Razaq
author: Chris N. Potts
author: Luk N. Van Wassenhove
published in: Discrete Applied Mathematics
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90-02
zbMATH DE Number: 4123515
zbMATH Keywords: survey
zbMATH Keywords: single machine
zbMATH Keywords: total weighted tardiness
zbMATH Keywords: lexicographic order
zbMATH Keywords: cardinality order
zbMATH Keywords: branch and bound algorithms
zbMATH Keywords: Lagrangean relaxation
MaRDI profile type: Publication
cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
cites work: An experimental comparison of solution algorithms for the single-machine tardiness problem
cites work: State-space relaxation procedures for the computation of bounds to routing problems
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: A dual algorithm for the one-machine scheduling problem
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
cites work: Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II—Computation and Structure
cites work: Q4178782
cites work: On Dynamic Programming Methods for Assembly Line Balancing
cites work: Q3206647
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
cites work: Dynamic programming and decomposition approaches for the single machine total tardiness problem
cites work: Minimizing Total Costs in One-Machine Scheduling
cites work: Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
cites work: On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
cites work: A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
cites work: Four solution techniques for a general one machine scheduling problem. A comparative study
full work available at URL: 0166-218x(90)90103-j
OpenAlex ID: W2056466128
Wikidata QID: Q127109988
description: scientific article; zbMATH DE number 4123515