A coordinated scheduling system for customer orders scheduling problem in job shop environments

Expert Systems with Applications

Volumn 37, Issue 12, 2010, Pages 7831-7837

  Liu, Cheng Hsiang ^a  

^a NATIONAL PINGTUNG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Customer orders scheduling; Dispatching; Machine learning; Model trees; Order releasing

Indexed keywords

LEARNING SYSTEMS; SALES; SCHEDULING;

COORDINATED SCHEDULING; CUSTOMER ORDERS; DISPATCHING; EXTENSIVE SIMULATIONS; JOB SHOP ENVIRONMENT; MODEL TREES; ORDER BASED PRODUCTION; ORDER RELEASING;

JOB SHOP SCHEDULING;

EID: 77957847693     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.04.055     Document Type: Article

References (19)

1. Ahmadi, R. H., Bagchi, U., & Roemer, T. A. (2005). Coordinated scheduling of customer orders for quick response. Naval Research Logistics, 52, 493-512.
2. Ahmadi, R. H., & Bagchi, U. (1992). The multi-job customer order scheduling problem. Working Paper, John E. Anderson Graduate School of Management, University of California, Los Angeles, California.
3. Bertrand, J. W. M., & van de Wakker, A. M. (2002). An investigation of order release and flow time allowance polices for assembly job shops. Production Planning and Control, 13(7), 639-648.
4. Blocher, J. D., & Chhajed, D. (1998). The customer order lead-time problem on parallel machines. Naval Research Logistics, 43(5), 629-654.
5. Blocher, J. D., Chhajed, D., & Leung, M. (1998). Customer order scheduling in a general job shop environment. Decision Sciences, 29(4), 951-981.
6. Erel, E., & Ghosh, J. B. (2007). Customer order scheduling on a single machine with family setup times: Complexity and algorithms. Applied Mathematics and Computation, 185, 11-18.
7. Gupta, J. N. D., Ho, J. C., & van de Veen, J. A. (1997). A single machine hierarchical scheduling with customer orders and multiple job classes. Annals of Operations Research, 70, 127-143.
8. Melnyk, S. A., & Ragatz, G. L. (1989). Order review/release issues and perspectives. International Journal of Production Research, 27(7), 1081-1096.
9. Moreira, M. R., & Alves, R. (2006). A new input-output control order release mechanism: How workload control improves manufacturing operations in a job shop. FEP Working Papers, Faculdade de Economia, Universidade do Proto.
10. Philipoom, P. R., Rees, L. P., & Wiegmann, L. (1994). Using artificial neural networks to determine internally-set due date assignment for shop scheduling. Decision Sciences, 25(5-6), 825-847.
11. Quinlan, J. R. (1992). Learning with continuous classes. In Proceedings of 5th Australian joint conference on artificial intelligent, World Scientific, Singapore (pp. 343-348).
12. Quinlan, J. R. (1993a). A case study in machine learning. In Proceedings of 16th Australian computer science conference, Brisbane (pp. 731-737).
13. Quinlan, J. R. (1993b). Combining instance based and model based learning. In Proceedings of the 10th international conference on machine learning (pp. 236- 243). San Mateo, CA: Morgan Kaufmann.
14. Ragatz, G. L., & Mabert, V. A. (1988). An evaluation of order release mechanisms in a job shop environment. Decision Sciences, 19(2), 167-189.
15. Ryan, S. M., Baynat, B., & Choobineh, F. F. (2000). Determining inventory levels in a CONWIP controlled job shop. IIE Transactions, 32(2), 105-114.
16. Sha, D. Y., Storch, R. L., & Liu, C.-H. (2007). Development of a regression-based method with case-based tuning to solve the due date assignment problem. International Journal of Production Research, 45(1), 65-82.
17. Spearman, M. L., Woodruff, D. L., & Hopp, W. J. (1990). CONWIP: A pull alternative to Kanban. International Journal of Production Research, 28(5), 879-894.
18. Wang, Y., & Witten, I. H. (1997). Induction of model trees for predicting continuous classes. In Proceedings of the poster papers of the European conference on machine learning, University of Economics, Faculty of Informatics and Statistics, Prague (pp. 128-137).
19. Yang, J. (2005). The complexity of customer order scheduling problems on parallel machines. Computers and Operations Research, 32, 1921-1939.