Complexity of single machine scheduling subject to nonnegative inventory constraints

This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory. Jobs that have to remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a singl...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 207; číslo 2; s. 605 - 619
Hlavní autoři:	Briskorn, Dirk, Choi, Byung-Cheon, Lee, Kangbok, Leung, Joseph, Pinedo, Michael
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.12.2010 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Applied sciences Completion time Complexity Complexity theory Computation Computational complexity Exact sciences and technology Inventories Inventory constraints Inventory control, production control. Distribution Inventory management Job shops Lateness Machine scheduling Machine scheduling Inventory constraints Computational complexity Strong NP-hardness Polynomial-time algorithms Operational research Operational research and scientific management Operational research. Management science Optimization Optimization algorithms Polynomial-time algorithms Production scheduling Scheduling Scheduling, sequencing Stockpiling Strong NP-hardness Studies Inventory constraints Polynomial-time algorithms Machine scheduling Computational complexity Strong NP-hardness Minimization Scheduling Makespan Polynomial method Delay Polynomial time Production management NP hard problem Lateness Single machine
ISSN:	0377-2217, 1872-6860
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!