Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
type: Item
instance of: scholarly article
title: Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
zbMATH Open document ID: 0823.90060
DOI: 10.1016/0167-6377(94)90069-8
author: Awi Federgruen
author: Gur Mosheiov
published in: Operations Research Letters
publication date: 1995-07-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 761910
zbMATH Keywords: greedy heuristics
zbMATH Keywords: worst-case optimality gaps
zbMATH Keywords: single-machine scheduling
zbMATH Keywords: common due-date
zbMATH Keywords: general earliness and tardiness costs
MaRDI profile type: Publication
full work available at URL: 0167-6377(94)90069-8
OpenAlex ID: W2088060524
cites work: Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
cites work: Minimizing mean absolute deviation of completion times about a common due date
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: Q4287985
cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
cites work: Scheduling with monotonous earliness and tardiness penalties
cites work: Minimizing the average deviation of job completion times about a common due date
cites work: Completion time variance minimization on a single machine is difficult
cites work: Q3682236
cites work: Best Algorithms for Approximating the Maximum of a Submodular Set Function
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Q4040221
cites work: Q3818127
description: scientific article; zbMATH DE number 761910