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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of scheduling Ročník 24; číslo 6; s. 615 - 647
Hlavní autoři:	Reynoso, Alejandro, Vakhania, Nodari
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.12.2021 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!