Single machine scheduling to minimize mean absolute lateness: A heuristic solution
type: Item
instance of: scholarly article
title: Single machine scheduling to minimize mean absolute lateness: A heuristic solution
zbMATH Open document ID: 0681.90050
DOI: 10.1016/0305-0548(90)90033-4
author: Timothy D. Fry
author: Ronald D. Armstrong
author: L. Drew Rosen
published in: Computers \& Operations Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4116295
zbMATH Keywords: heuristic solution
zbMATH Keywords: adjacent pairwise interchange
zbMATH Keywords: mean absolute lateness
zbMATH Keywords: single machine
MaRDI profile type: Publication
full work available at URL: 0305-0548(90)90033-4
OpenAlex ID: W2038820973
cites work: Q4658190
cites work: Minimizing the average deviation of job completion times about a common due date
cites work: Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
cites work: Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
cites work: Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
cites work: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
cites work: A branch and bound procedure to minimize mean absolute lateness on a single processor
cites work: An Approach to Solving Linear Discrete Optimization Problems
cites work: Minimizing Total Costs in One-Machine Scheduling
description: scientific article; zbMATH DE number 4116295