175
Views
17
CrossRef citations to date
0
Altmetric
Original Articles

Coordinated scheduling of customer orders with decentralized machine locations

&
Pages 899-909 | Received 01 Mar 2006, Accepted 01 Aug 2006, Published online: 28 Jun 2007

REFERENCES

  • Ahmadi , R. , Bagchi , U. and Roemer , T. A. 2005 . Coordinated scheduling of customer orders for quick response . Naval Research Logistics , 52 : 493 – 512 .
  • Blocher , J. D. and Chhajed , D. 1996 . The customer order lead time problem on parallel machines . Naval Research Logistics , 43 : 629 – 654 .
  • Blocher , J. D. , Chhajed , D. and Leung , M. 1998 . Customer order scheduling in a general job shop environment . Decision Sciences , 29 : 951 – 981 .
  • Cai , X. and Zhou , X. 2004 . Deterministic and stochastic scheduling with teamwork tasks . Naval Research Logistics , 51 : 818 – 840 .
  • Chen , Z-L. 2004 . “ Integrated production and distribution operations: taxonomy, models, and review ” . In Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era , Edited by: Simchi-Levi , D. , Wu , D. and Shen , Z-J. 711 – 745 . Boston, MA : Kluwer .
  • Chen , Z-L. and Pundoor , G. 2006 . Order assignment and scheduling in a supply chain . Operations Research , 3 : 555 – 572 .
  • Julien , F. M. and Magazine , M. J. 1990 . Scheduling customer orders: an alternative production scheduling approach . Journal of Manufacturing and Operations Management , 3 : 177 – 199 .
  • Leung , J. Y.-T. , Li , H. and Pinedo , M. 2005 . Order scheduling in an environment with dedicated resources in parallel . Journal of Scheduling , 8 : 355 – 386 .
  • Leung , J. Y.-T. , Li , H. and Pinedo , M. 2007 . Scheduling orders for multiple product types to minimize total weighted completion time . Discrete Applied Mathematics , 155 : 945 – 970 .
  • Leung , J. Y.-T. , Li , H. and Pinedo , M. 2006a . Scheduling orders for multiple product types with due date related objectives . European Journal of Operational Research , 168 : 370 – 389 .
  • Leung , J. Y.-T. , Li , H. and Pinedo , M. 2006b . Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel . Naval Research Logistics , 53 : 243 – 260 .
  • Leung , J. Y.-T. , Li , H. , Pinedo , M. and Sriskandarajah , C. 2005 . Open shops with jobs overlap—revisited . European Journal of Operational Research , 163 : 569 – 571 .
  • Leung , J. Y.-T. , Li , H. , Pinedo , M. and Zhang , J. 2007 . Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines . Information Processing Letters , 103 : 119 – 129 .
  • Li , C.-L. and Vairaktarakis , G. 2007 . Coordinating production and distribution of jobs with bundling operations . IIE Transactions , 39 : 203 – 215 .
  • Sung , C. S. and Yoon , S. H. 1998 . Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines . International Journal of Production Economics , 54 : 247 – 255 .
  • Wagneur , E. and Sriskandarajah , C. 1993 . Open shops with jobs overlap . European Journal of Operational Research , 71 : 366 – 378 .
  • Yang , J. 2003 . Scheduling parallel machines for the customer order problem with fixed batch sequence . Journal of the Korean Institute of Industrial Engineers , 29 : 304 – 311 .
  • Yang , J. 2005 . The complexity of customer order scheduling problems on parallel machines . Computers and Operations Research , 32 : 1921 – 1939 .
  • Yang , J. and Posner , M. E. 2005 . Scheduling parallel machines for the customer order problem . Journal of Scheduling , 8 : 49 – 74 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.