Single machine scheduling to maximize the number of on-time jobs with generalized due-dates

In scheduling problems with generalized due dates (gdd), the due dates are specified according to their position in the sequence, and the j -th due date is assigned to the job in the j -th position. We study a single-machine problem with generalized due dates, where the objective is maximizing the n...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of scheduling Vol. 23; no. 3; pp. 289 - 299
Main Authors:	Gerstl, Enrique, Mosheiov, Gur
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2020 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Dynamic programming Integer programming Job shops Operations Research/Decision Theory Optimization Polynomials Scheduling Supply Chain Management NP-hardness Scheduling Generalized due dates Branch-and-bound algorithm Single machine Heuristic
ISSN:	1094-6136, 1099-1425
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!