AA fully polynomial approximation scheme for scheduling a sinA fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late workde Luk N. van WassenhoveMateriasEconometric modelsTask analysisEdiciones (1)A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work (1991)INSEAD · inglésMás obras de Luk N. van WassenhoveReverse logistics
QQuantitative Approaches to Distribution Logistics and SupplyQuantitative Approaches to Distribution Logistics and Supply Chain Management
EExact and approximation algorithms for the operational fixedExact and approximation algorithms for the operational fixed interval scheduling problem
IIntegrating scheduling with batching and lot-sizingIntegrating scheduling with batching and lot-sizing
