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

References

• Agarwal , A , Colak , S and Eryarsoy , E . 2006 . Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach . European Journal of Operational Research , 169 ( 3 ) : 801 – 815 .
   Web of Science ®Google Scholar
• Ahmed , I and Fisher , WW . 1992 . Due date assignment, job order release, and sequencing interaction in job shop scheduling . Decision Science , 23 ( 3 ) : 633 – 647 .
   Web of Science ®Google Scholar
• Aickelin , U , Burke , EK 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 .
   Web of Science ®Google Scholar
• Aickelin , U and Li , J . 2007 . An estimation of distribution algorithm for nurse scheduling . Annals of Operation Research , 155 ( 1 ) : 289 – 309 .
   Web of Science ®Google Scholar
• Akers , SB . 1956 . A graphical approach to production scheduling problems . Operation Research , 4 ( 2 ) : 244 – 245 .
   Web of Science ®Google Scholar
• Baykasoğlu , A , Göçken , M and Unutmaz , ZD . 2008a . Due date assignment using ADRES and simulated annealing . International Journal of Industrial Systems Engineering , 3 ( 3 ) : 277 – 297 .
   Google Scholar
• Baykasoğlu , A , Göçken , M and Unutmaz , ZD . 2008b . New approaches to due date assignment in job shops . European Journal of Operational Research , 187 ( 1 ) : 31 – 45 .
   Web of Science ®Google Scholar
• Brucker , P , Kravchenko , SA and Sotskov , YN . 1997 . On the complexity of two machine job shop scheduling with regular objective functions . OR Spectrum , 19 ( 1 ) : 5 – 10 .
   Google Scholar
• Brucker , P , Sotskov , YN 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 .
   Web of Science ®Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Chang , PC , Nieh , JC and Liao , TW . 2005 . Evolving fuzzy rules for due-date assignment problem in semiconductor manufacturing factory . Journal of Intelligent Manufacturing , 16 ( 4–5 ) : 549 – 557 .
   Web of Science ®Google Scholar
• Chen , T , Jeang , A and Wang , YC . 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 .
   Web of Science ®Google Scholar
• Chickering, D.M., Geiger, D., and Heckerman, D., 1994. Learning Bayesian networks is 𝒩𝒫-hard. Technical report MSR-TR-94-17, Microsoft Research, Redmond, Wirginia
   Google Scholar
• Chiu , C , Chang , PC and Chiu , NH . 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 .
   Web of Science ®Google Scholar
• Conway , RW . 1965 . Priority dispatching and job lateness in a job shop . Journal of Industrial Engineering , 16 ( 4 ) : 228 – 237 .
   Web of Science ®Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Finke , DA , Medeiros , DJ and Traband , MT . 2007 . Multiple machine JIT scheduling: a tabu search approach . International Journal of Production Research , 45 ( 21 ) : 4899 – 4915 .
   Web of Science ®Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Guerrero , HH and Kern , G . 1988 . How to more effectively accept and refuse orders . Production and Inventory Management , 29 ( 4 ) : 59 – 63 .
   Google Scholar
• Haupt , R . 1989 . A survey of priority rule-based scheduling . OR Spectrum , 11 ( 1 ) : 3 – 16 .
   Google Scholar
• Heckerman , D , Geiger , D and Chickering , DM . 1995 . Learning Bayesian networks: the combination of knowledge and statistical data . Machine Learning , 20 ( 3 ) : 197 – 243 .
   Web of Science ®Google Scholar
• Hino , CM , Ronconi , CP and Mendes , AB . 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 .
   Web of Science ®Google Scholar
• Hsu , SY and Sha , DY . 2004 . Due date assignment using artificial neural networks under different shop floor control strategies . International Journal of Production Research , 42 ( 9 ) : 1727 – 1745 .
   Web of Science ®Google Scholar
• Jain , AS and Meeran , S . 1999 . Deterministic job-shop scheduling: past, present and future . European Journal of Operational Research , 113 ( 2 ) : 390 – 434 .
   Web of Science ®Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Kumar , CS and Panneerselvam , R . 2007 . Literature review of JIT-KANBAN system . International Journal of Advanced Manufacturing Technology , 32 ( 3-4 ) : 393 – 408 .
   Web of Science ®Google Scholar
• Larrañaga , P and Lozano , JA . 2002 . Estimation of distribution algorithms: a new tool for evolutionary optimization , Boston : Kluwer Academic Publishers .
   Google Scholar
• Lawler , EL . 1977 . A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness . Annals of Discrete Mathematics , 1 : 331 – 342 .
   Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Lenstra , JK , Kan , AHGR and Brucker , P . 1977 . Complexity of machine scheduling problems . Annals of Discrete Mathematics , 1 : 343 – 362 .
   Google Scholar
• Lucas , AJ and Moses , SA . 2005 . Scalability and performance of computational structures for real-time order promising . Journal of Intelligent Manufacturing , 16 ( 1 ) : 5 – 20 .
   Web of Science ®Google Scholar
• Moodie , DR . 1999 . Demand management: the evaluation of price and due date negotiation strategies using simulation . Productions and Operations Management , 8 ( 2 ) : 151 – 162 .
   Web of Science ®Google Scholar
• Moodie , DR and Bobrowski , PM . 1999 . Due date demand management: negotiating the trade-off between price and delivery . International Journal of Production Research , 37 ( 5 ) : 997 – 1021 .
   Web of Science ®Google Scholar
• Pelikan , M , Goldberg , DE and Lobo , FG . 2002 . A survey of optimization by building and using probabilistic models . Computational Optimization and Applications , 21 ( 1 ) : 5 – 20 .
   Web of Science ®Google Scholar
• Ragartz , GL and Mabert , VA . 1984 . Framework for the study of due date management in job shop . Production Research , 22 ( 4 ) : 685 – 695 .
   Web of Science ®Google Scholar
• Rom , WO and Slotnick , SA . 2009 . Order acceptance using genetic algorithms . Computers & Operations Research , 36 ( 6 ) : 1758 – 1767 .
   Web of Science ®Google Scholar
• Sha , DY and Hsu , SY . 2004 . Due-date assignment in wafer fabrication using artificial neural networks . International Journal of Advanced Manufacturing Technology , 23 ( 9–10 ) : 768 – 775 .
   Web of Science ®Google Scholar
• Sha , DY and Liu , CH . 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 .
   Web of Science ®Google Scholar
• 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 . 2002 . pp. 465 – 471 . Singapore
   Google Scholar
• Vig , MM and Dooley , KJ . 1991 . Dynamic rules for due date assignment . International Journal of Production Research , 29 ( 7 ) : 1361 – 1377 .
   Web of Science ®Google Scholar
• White , RE , Ojha , D and Kuo , CC . 2010 . A competitive progression perspective of JIT systems: evidence from early US implementations . International Journal of Production Research , 48 ( 20 ) : 6103 – 6124 .
   Web of Science ®Google Scholar
• Zhang , CY . 2008 . A very fast TS/SA algorithm for the job shop scheduling problem . Computers & Operations Research , 35 ( 1 ) : 282 – 294 .
   Web of Science ®Google Scholar
• Zhou , R , Nee , AYC and Lee , HP . 2009 . Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems . International Journal of Production Research , 47 ( 11 ) : 2903 – 2920 .
   Web of Science ®Google Scholar