Two-stage supply chain scheduling with an assignable common due window

DOI10.15960/J.CNKI.ISSN.1007-6093.2016.04.004zbMATH Open1374.90179MaRDI QIDQ5282671FDOQ5282671

Authors: Long Zhang, Yuzhong Zhang 

Publication date: 14 July 2017

Recommendations

• An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
• scientific article; zbMATH DE number 6832017
• Two-stage medical supply chain scheduling with an assignable common due window and shelf life
• Single-machine common due window assignment and scheduling to minimize the total cost
• Minmax scheduling problems with a common due-window

zbMATH Keywords

dynamic programming algorithmsupply chain schedulingbatch deliverydue window

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cited In (4)

• Scheduling in a two-stage supply chain with uncertain parameters
• Title not available (Why is that?)
• Title not available (Why is that?)
• An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time

This page was built for publication: Two-stage supply chain scheduling with an assignable common due window

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282671)