Theoretical and practical issues in single-machine scheduling with two job release and delivery times

We study a single-machine scheduling problem with two allowable job release and delivery times. This special case of a strongly NP-hard single-machine scheduling problem with an arbitrary number of job release and delivery times and with the objective to minimize the maximum job completion time rema...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of scheduling Vol. 24; no. 6; pp. 615 - 647
Main Authors:	Reynoso, Alejandro, Vakhania, Nodari
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2021 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Completion time Dynamic programming Heuristic Heuristic methods Job shops Operations Research/Decision Theory Optimality criteria Optimization Polynomials Scheduling Supply Chain Management Single-machine scheduling Release time Delivery time Polynomial and pseudo-polynomial time algorithms SUBSET SUM Time complexity
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!