Minimizing the earliness-tardiness costs on a single machine

Authors:
Jakub Bauman;Joanna Józefowska
Affiliations:
Baj-soft, Poznań, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland
Venue:
Computers and Operations Research
Year:
2006

Citing 4
Cited 5

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
The single machine early/tardy problem

Management Science
Sequencing with earliness and tardiness penalties: a review

Operations Research
PERT scheduling with convex cost functions

Theoretical Computer Science

An improved earliness-tardiness timing algorithm

Computers and Operations Research
A Hybrid Electromagnetism-Like Algorithm for Single Machine Scheduling Problem

ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Single machine due date assignment scheduling problem with customer service level in fuzzy environment

Applied Soft Computing
Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs

Journal of Intelligent Manufacturing
Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The cost functions are job dependent and asymmetric. The problem consists of two sub-problems. The first one is to find a sequence of jobs and the second one is to find the job completion times that are optimal for the given sequence. We consider the second sub-problem and propose an algorithm solving the problem in O(n log n) time.