A double-layered optimisation approach for the integrated due date assignment and scheduling problem

International Journal of Production Research

Volumn 50, Issue 1, 2012, Pages 5-22

  Zhang, Rui ^a   Wu, Cheng ^b  

^a NANCHANG UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

due date assignment; estimation of distribution; job shop scheduling problem; parameter perturbation method

Indexed keywords

COMPUTATIONAL EXPERIMENT; DUE DATES; DUE-DATE ASSIGNMENT; DUE-DATE QUOTATION; DUE-DATE SETTING; ESTIMATION OF DISTRIBUTION; JOB SHOP SCHEDULING PROBLEMS; LEADTIME; MAKE TO ORDER; MARKET COMPETITION; NEIGHBOURHOOD SEARCH; OPTIMISATION MODELS; OPTIMISATIONS; PARAMETER PERTURBATION; PRODUCTION SCHEDULING PROBLEMS; SCHEDULING PROBLEM; SHOP SCHEDULING;

ALGORITHMS; BAYESIAN NETWORKS; COMPETITION; INDUSTRY; OPTIMIZATION; PRODUCTION ENGINEERING; SCHEDULING;

PROBLEM SOLVING;

EID: 84863280144     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.571440     Document Type: Article

References (43)

1. Agarwal, A., Colak, S., and Eryarsoy, E., 2006. Improvement heuristic for the flow-shop scheduling problem: an adaptivelearning approach. European Journal of Operational Research, 169 (3), 801-815. (Pubitemid 41492017)
2. Ahmed, I. and Fisher, W.W., 1992. Due date assignment, job order release, and sequencing interaction in job shop scheduling. Decision Science, 23 (3), 633-647.
3. Aickelin, U., Burke, E.K., and Li, J., 2007. An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. Journal of Operational Research Society, 58 (12), 1574-1585. (Pubitemid 350129146)
4. Aickelin, U. and Li, J., 2007. An estimation of distribution algorithm for nurse scheduling. Annals of Operation Research, 155 (1), 289-309.
5. Akers, S.B., 1956. A graphical approach to production scheduling problems. Operation Research, 4 (2), 244-245.
6. Baykasoǧlu, A., Göçken, M., and Unutmaz, Z.D., 2008a. Due date assignment using ADRES and simulated annealing. International Journal of Industrial Systems Engineering, 3 (3), 277-297. (Pubitemid 351385702)
7. Baykasoǧlu, A., Göçken, M., and Unutmaz, Z.D., 2008b. New approaches to due date assignment in job shops. European Journal of Operational Research, 187 (1), 31-45. (Pubitemid 350061089)
8. Brucker, P., Kravchenko, S.A., and Sotskov, Y.N., 1997. On the complexity of two machine job shop scheduling with regular objective functions. OR Spectrum, 19 (1), 5-10.
9. Brucker, P., Sotskov, Y.N., and Werner, F., 2007. Complexity of shop-scheduling problems with fixed number of jobs: a survey. Mathematical Methods of Operations Research, 65 (3), 461-481. (Pubitemid 46868574)
10. Chandra, P., Mehta, P., and Tirupati, D., 2009. Permutation flow shop scheduling with earliness and tardiness penalties. International Journal of Production Research, 47 (20), 5591-5610.
11. Chang, P.C., Nieh, J.C., and Liao, T.W., 2005. Evolving fuzzy rules for due-date assignment problem in semiconductor manufacturing factory. Journal of Intelligent Manufacturing, 16 (4-5), 549-557. (Pubitemid 41067724)
12. Chen, T., Jeang, A., and Wang, Y.C., 2008. A hybrid neural network and selective allowance approach for internal due date assignment in a wafer fabrication plant. International Journal of Advanced Manufacturing Technology, 36 (5-6), 570-581. (Pubitemid 351665146)
13. Chickering, D.M., Geiger, D., and Heckerman, D., 1994. Learning Bayesian networks is NP-hard. Technical report MSR-TR- 94-17, Microsoft Research, Redmond, Wirginia.
14. Chiu, C., Chang, P.C., and Chiu, N.H., 2003. A case-based expert support system for due-date assignment in a wafer fabrication factory. Journal of Intelligent Manufacturing, 14 (3-4), 287-296.
15. Conway, R.W., 1965. Priority dispatching and job lateness in a job shop. Journal of Industrial Engineering, 16 (4), 228-237.
16. Essafi, I., Mati, Y., and Dauzère-Pérès, S., 2008. A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers & Operations Research, 35 (8), 2599-2616. (Pubitemid 350245426)
17. Finke, D.A., Medeiros, D.J., and Traband, M.T., 2007. Multiple machine JIT scheduling: a tabu search approach. International Journal of Production Research, 45 (21), 4899-4915. (Pubitemid 47507492)
18. Gordon, V., Proth, J., and Chu, C., 2002. Due date assignment and scheduling: SLK, TWK and other due date assignment models. Production Planning and Control, 13 (2), 117-132. (Pubitemid 34586389)
19. Guerrero, H.H. and Kern, G., 1988. How to more effectively accept and refuse orders. Production and Inventory Management, 29 (4), 59-63.
20. Haupt, R., 1989. A survey of priority rule-based scheduling. OR Spectrum, 11 (1), 3-16.
21. Heckerman, D., Geiger, D., and Chickering, D.M., 1995. Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning, 20 (3), 197-243.
22. Hino, C.M., Ronconi, C.P., and Mendes, A.B., 2005. Minimizing earliness and tardiness penalties in a single-machine problem with a common due date. European Journal of Operational Research, 160 (1), 190-201.
23. Hsu, S.Y. and Sha, D.Y., 2004. Due date assignment using artificial neural networks under different shop floor control strategies. International Journal of Production Research, 42 (9), 1727-1745.
24. Jain, A.S. and Meeran, S., 1999. Deterministic job-shop scheduling: past, present and future. European Journal of Operational Research, 113 (2), 390-434.
25. Jarboui, B., Eddaly, M., and Siarry, P., 2009. An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Computers & Operations Research, 36 (9), 2638-2646.
26. Kumar, C.S. and Panneerselvam, R., 2007. Literature review of JIT-KANBAN system. International Journal of Advanced Manufacturing Technology, 32 (3-4), 393-408. (Pubitemid 46331772)
27. Larrañaga, P. and Lozano, J.A., 2002. Estimation of distribution algorithms: a new tool for evolutionary optimization. Boston: Kluwer Academic Publishers.
28. Lawler, E.L., 1977. A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1, 331-342.
29. Lebacque, V., Jost, V., and Brauner, N., 2007. Simultaneous optimization of classical objectives in JIT scheduling. European Journal of Operational Research, 182 (1), 29-39. (Pubitemid 46561153)
30. Lenstra, J.K., Kan, A.H.G.R., and Brucker, P., 1977. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343-362.
31. Lucas, A.J. and Moses, S.A., 2005. Scalability and performance of computational structures for real-time order promising. Journal of Intelligent Manufacturing, 16 (1), 5-20. (Pubitemid 40356752)
32. Moodie, D.R., 1999. Demand management: the evaluation of price and due date negotiation strategies using simulation. Productions and Operations Management, 8 (2), 151-162.
33. Moodie, D.R. and Bobrowski, P.M., 1999. Due date demand management: negotiating the trade-off between price and delivery. International Journal of Production Research, 37 (5), 997-1021.
34. Pelikan, M., Goldberg, D.E., and Lobo, F.G., 2002. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21 (1), 5-20. (Pubitemid 34172679)
35. Ragartz, G.L. and Mabert, V.A., 1984. Framework for the study of due date management in job shop. Production Research, 22 (4), 685-695.
36. Rom, W.O. and Slotnick, S.A., 2009. Order acceptance using genetic algorithms. Computers & Operations Research, 36 (6), 1758-1767.
37. Sha, D.Y. and Hsu, S.Y., 2004. Due-date assignment in wafer fabrication using artificial neural networks. International Journal of Advanced Manufacturing Technology, 23 (9-10), 768-775.
38. Sha, D.Y. and Liu, C.H., 2006. Development and evaluation of a tree-indexing approach to improve case-based reasoning: illustrated using the due date assignment problem. International Journal of Production Research, 44 (15), 3033-3049. (Pubitemid 43898332)
39. Tsutsui, S. and Miki, M., 2002. Solving flow shop scheduling problems with probabilistic model-building genetic algorithms using edge histograms. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning, Singapore, 465-471.
40. Vig, M.M. and Dooley, K.J., 1991. Dynamic rules for due date assignment. International Journal of Production Research, 29 (7), 1361-1377.
41. White, R.E., Ojha, D., and Kuo, C.C., 2010. A competitive progression perspective of JIT systems: evidence from early US implementations. International Journal of Production Research, 48 (20), 6103-6124.
42. Zhang, C.Y., et al., 2008. A very fast TS/SA algorithm for the job shop scheduling problem. Computers & Operations Research, 35 (1), 282-294. (Pubitemid 46899361)
43. Zhou, R., Nee, A.Y.C., and Lee, H.P., 2009. Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems. International Journal of Production Research, 47 (11), 2903-2920.