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

Full description

Saved in:

Bibliographic Details
Published in:	The Journal of the Operational Research Society Vol. 66; no. 3; pp. 380 - 391
Main Authors:	Wang, Gang, Lei, Lei, Lee, Kangbok
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 01.03.2015 Palgrave Macmillan Palgrave Macmillan UK Taylor & Francis Ltd
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!