Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/33867
Title: Multiple-machine scheduling with earliness, tardiness and completion time penalties
Authors: Biskup, D
Cheng, TCE 
Keywords: Earliness
Scheduling
Sequencing
Tardiness
Issue Date: 1999
Publisher: Pergamon Press
Source: Computers and operations research, 1999, v. 26, no. 1, p. 45-57 How to cite?
Journal: Computers and operations research 
Abstract: This study deals with the problem of scheduling a number of jobs on parallel machines. We assume that companies are mainly interested in two objectives, namely achieving small deviations from a common due date and short flowtimes. Therefore earliness, tardiness and completion time penalties for the jobs are introduced. We are able to show that the problem is intractable and, consequently, develop an efficient heuristic to obtain near-optimal solutions. We consider the problem of scheduling n jobs on m parallel and identical machines. The goal is to find an optimal permutation of the jobs and an optimal due date which jointly minimize an objective function consisting of earliness, tardiness and completion time penalties. We show that the problem is NP-hard and present a polynomially solvable case. Furthermore, a heuristic is developed and computationally demonstrated to be efficient in obtaining near-optimal solutions.We consider the problem of scheduling n jobs on m parallel and identical machines. The goal is to find an optimal permutation of the jobs and an optimal due date which jointly minimize an objective function consisting of earliness, tardiness and completion time penalties. We show that the problem is NP-hard and present a polynomially solvable case. Furthermore, a heuristic is developed and computationally demonstrated to be efficient in obtaining near-optimal solutions.
URI: http://hdl.handle.net/10397/33867
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/S0305-0548(98)00044-6
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

17
Last Week
0
Last month
0
Citations as of Feb 20, 2018

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of Feb 22, 2018

Page view(s)

68
Last Week
5
Last month
Citations as of Feb 19, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.