Parallel machine earliness and tardiness scheduling with proportional weights

Authors:
Hongyi Sun;Guoqing Wang
Affiliations:
Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, Hong Kong;Department of Business Administration, Jinan University, Guangzhou, People's Republic of China
Venue:
Computers and Operations Research
Year:
2003

Citing 6
Cited 10

Sequencing with earliness and tardiness penalties: a review

Operations Research
Weighted-tardiness scheduling on parallel machines with proportional weights

Operations Research
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Weighted tardiness single machine scheduling with proportional weights

Management Science
Heuristics for multimachine scheduling problems with earliness and tardiness costs

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Exponential neighborhood search for a parallel machine scheduling problem

Computers and Operations Research
Planning production using mathematical programming: The case of a woodturning company

Computers and Operations Research
Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration

Computers and Operations Research
Efficiency of Metaheuristics in PMJS_E/T Scheduling Problem

KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
The common due-date early/tardy scheduling problem on a parallelmachine under the effects of time-dependent learning and linear and nonlinear deterioration

Expert Systems with Applications: An International Journal
Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs

Journal of Intelligent Manufacturing
Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning

Computers and Operations Research
A coupled gradient network approach for the multi machine earliness and tardiness scheduling problem

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling: An International Journal
A multi-agent system for the weighted earliness tardiness parallel machine problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we study the problem of scheduling n jobs with a common due date and proportional early and tardy penalties on m identical parallel machines. We show that the problem is NP-hard and propose a dynamic programming algorithm to solve it. We also propose two heuristics to tackle the problem and analyze their worst-case error bounds.