Coordinated scheduling of customer orders for quick response
From MaRDI portal
Publication:3367031
DOI10.1002/nav.20092zbMath1122.90034MaRDI QIDQ3367031
Thomas A. Roemer, Reza H. Ahmadi, Uttarayan Bagchi
Publication date: 23 January 2006
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20092
90C35: Programming involving graphs or networks
90B35: Deterministic scheduling theory in operations research
Related Items
Minimizing the sum of weighted completion times in a concurrent open shop, Customer order scheduling on a single machine with family setup times: complexity and algorithms, A note on the complexity of the concurrent open shop problem, Scheduling orders for multiple product types to minimize total weighted completion time, Scheduling on parallel machines to minimise maximum lateness for the customer order problem, Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time
Cites Work