A decomposition algorithm for the single machine total tardiness problem

Authors:
C.N Potts;L.N Van Wassenhove
Affiliations:
Department of Mathematics, University of Keele, Keele, Straffordshire, ST5 5BG, United Kingdom;Departement Werktuigkunde, Afdeling Industrieel Beleid, Katholieke Universiteit Leuven, Celestijnenlaan 300 B, B-3030 Leuven-Heverlee, Belgium
Venue:
Operations Research Letters
Year:
1982

Citing 0
Cited 17

Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

Computers and Operations Research
Lot streaming for product assembly in job shop environment

Robotics and Computer-Integrated Manufacturing
A hybrid algorithm for the single-machine total tardiness problem

Computers and Operations Research
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness

Computers and Operations Research
A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times

Computers and Operations Research
Mixed integer programming formulations for single machine scheduling problems

Computers and Industrial Engineering
An evolutionary algorithm for assembly job shop with part sharing

Computers and Industrial Engineering
A resource-constrained assembly job shop scheduling problem with Lot Streaming technique

Computers and Industrial Engineering
Solving the single-machine sequencing problem using integer programming

Computers and Industrial Engineering
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

Computers and Operations Research
A note on a single machine scheduling problem with generalized total tardiness objective function

Information Processing Letters
Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem

Mathematical and Computer Modelling: An International Journal
Scheduling a single machine to minimize a regular objective function under setup constraints

Discrete Optimization
On decomposition of the total tardiness problem

Operations Research Letters
Decomposition of the single machine total tardiness problem

Operations Research Letters
A theoretical development for the total tardiness problem and its application in branch and bound algorithms

Computers and Operations Research
A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of sequencing jobs on a single machine to minimize total tardiness is considered. An algorithm, which decomposes the problem into subproblems which are then solved by dynamic programming when they are sufficiently small, is presented and is tested on problems with up to 100 jobs.