Algorithm for minimizing weighted earliness penalty in single-machine problem
type: Item
instance of: scholarly article
title: Algorithm for minimizing weighted earliness penalty in single-machine problem
zbMATH Open document ID: 1071.90020
author: Supachai Pathumnakul
author: Pius J. Egbelu
published in: European Journal of Operational Research
publication date: 2005-02-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2132682
zbMATH Keywords: Scheduling
zbMATH Keywords: Heuristic
zbMATH Keywords: Deadline
zbMATH Keywords: Earliness
zbMATH Keywords: Tardiness
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.07.017
OpenAlex ID: W2166180443
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Single machine scheduling to minimize weighted earliness subject to no tardy jobs
cites work: A fixed interval due-date scheduling problem with earliness and due-date costs
cites work: The Single Machine Early/Tardy Problem
cites work: Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
DOI: 10.1016/J.EJOR.2003.07.017
Recommended article: Algorithms for a class of single-machine weighted tardiness and earliness problems
Recommended article: Single machine scheduling to minimize weighted earliness subject to maximum tardiness
Recommended article: OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
Recommended article: Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted
Recommended article: Single machine scheduling to minimize weighted earliness subject to no tardy jobs
Recommended article: Algorithms for a class of single-machine weighted tardiness and earliness problems. Erratum
Recommended article: On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
Recommended article: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
Recommended article: Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
Recommended article: Approximation algorithms for minimizing the total weighted tardiness on a single machine
description: scientific article; zbMATH DE number 2132682