Supply chain scheduling with receiving deadlines and non-linear penalty

We study the operations scheduling problem with delivery deadlines in a three-stage supply chain process consisting of (1) heterogeneous suppliers, (2) capacitated processing centres (PCs), and (3) a network of business customers. The suppliers make and ship semi-finished products to the PCs where p...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	The Journal of the Operational Research Society Ročník 66; číslo 3; s. 380 - 391
Hlavní autoři:	Wang, Gang, Lei, Lei, Lee, Kangbok
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London Taylor & Francis 01.03.2015 Palgrave Macmillan Palgrave Macmillan UK Taylor & Francis Ltd
Témata:	Algorithms Business and Management capacitated facilities Customer services deadline constraints Dynamic programming General Paper General Papers Management Manufacturing Network management systems Operations Research/Decision Theory operations scheduling Optimization Order quantity pseudo-polynomial time algorithm Scheduling Shipments Suppliers Supplies Supply chains dynamic programming operations scheduling capacitated facilities deadline constraints pseudo-polynomial time algorithm
ISSN:	0160-5682, 1476-9360
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!