Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling

References

• Aytug , H , Khouja , M and Vergara , FE . 2003 . Use of genetic algorithms to solve production and operations management problems: a review . Int. J. Prod. Res. , 41 : 3955 – 4009 .
   Web of Science ®Google Scholar
• Balasubramanian , H , Monch , L , Fowler , J and Pfund , M . 2004 . Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total tardiness . Int. J. Prod. Res. , 42 : 1621 – 1638 .
   Web of Science ®Google Scholar
• Chu , CK . 1995 . A mathematical programming approach towards optimised master production scheduling . Int. J. Prod. Econ. , 38 : 269 – 279 .
   Web of Science ®Google Scholar
• Clark , AR . 2003 . Optimisation approximations for capacity constrained material requirements planning . Int. J. Prod. Econ. , 84 : 115 – 131 .
   Web of Science ®Google Scholar
• Darlington , J and Moar , C . 1996 . ‘MRP rest in peace …’ . Mgmt Account , October, 14
   Google Scholar
• Günther , HO and Tempelmeier , H . 2005 . Produktion und Logistik , 6th , Berlin : Springer .
   Google Scholar
• Hao , Q , Soong , BH , Wang , D and Yang , Z . 1998 . Earliness/tardiness production planning by JIT philosophy for job-lot manufacturing systems . Prod. Plann. Contr. , 9 : 181 – 188 .
   Web of Science ®Google Scholar
• Hasija , S and Rajendran , C . 2004 . Scheduling in flowshops to minimize total tardiness of jobs . Int. J. Prod. Res. , 42 : 2289 – 2301 .
   Web of Science ®Google Scholar
• Haupt , RL and Haupt , SE . 1998 . Practical Genetic Algorithms , New York : Wiley–Interscience .
   Google Scholar
• Hill , JA , Berry , WL and Schilling , DA . 2003 . Revising the master production schedule in sequence dependent processes . Int. J. Prod. Res. , 41 : 2021 – 2035 .
   Web of Science ®Google Scholar
• Ho , JC and Chang , YL . 2001 . An integrated MRP & JIT framework . Comput. Ind. Engng , 41 : 173 – 185 .
   Web of Science ®Google Scholar
• Holland , JH . 1992 . Genetic Algorithms , New York : Science Am. .
   Google Scholar
• Hollier , RH and Cooke , C . 1991 . A Practical Guide to Inventory Reduction , Bedford, , UK : IFS .
   Google Scholar
• Hopp , WJ and Spearman , ML . 1996 . Factory Physics: Foundations of Manufacturing Management , USA : Irwin .
   Google Scholar
• Hsu , SY and Sha , DY . 2004 . Due date assignment using artificial neural networks under different shop floor control strategies . Int. J. Prod. Res. , 42 : 1727 – 1745 .
   Web of Science ®Google Scholar
• Ip , WH , Li , Y , Man , KF and Tang , KS . 2000 . Multi-product planning and scheduling using genetic algorithm approach . Comput. Ind. Engng , 38 : 283 – 296 .
   Web of Science ®Google Scholar
• Lee , GC , Kim , YD and Choi , SW . 2004 . Bottleneck-focused scheduling for a hybrid flow-shop . Int. J. Prod. Res. , 42 : 165 – 181 .
   Web of Science ®Google Scholar
• Mason , SJ , Jin , S and Wessels , CM . 2004 . Rescheduling strategies for minimizing total weighted tardiness in complex job-shops . Int. J. Prod. Res. , 42 : 613 – 628 .
   Web of Science ®Google Scholar
• Mattfeld , DC and Bierwirth , C . 2004 . An efficient genetic algorithm for job shop scheduling with tardiness objectives . Eur. J. Oper. Res. , 155 : 616 – 630 .
   Web of Science ®Google Scholar
• Muhlemann , A , Oakland , J and Lockyer , K . 1992 . Production and Operations Management , London : Pearson Education Limited .
   Google Scholar
• Ozdamar , L and Yazgac , T . 1997 . Capacity driven due date settings in make-to-order production systems . Int. J. Prod. Econ. , 49 : 29 – 44 .
   Web of Science ®Google Scholar
• Pongcharoen , P , Hicks , C , Braiden , PM and Stewardson , DJ . 2002 . Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products . Int. J. Prod. Econ. , 78 : 311 – 322 .
   Web of Science ®Google Scholar
• Pongcharoen , P , Hicks , C and Braiden , PM . 2004 . The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure . Eur. J. Oper. Res. , 152 : 215 – 225 .
   Web of Science ®Google Scholar
• Proud , JF . 1999 . Master Scheduling , 2nd , Wiley : New York .
   Google Scholar
• Slack , N , Chambers , S and Johnston , R . 2001 . Operations Management , 3rd , London : Pearson Education Limited .
   Google Scholar
• Tempelmeier , H and Derstroff , M . 1996 . A lagrangean heuristic for multi-item multi-level constrained lotsizing with setup times . Mgmt Sci. , 42 : 738 – 757 .
   Web of Science ®Google Scholar
• Thiagarajan , S and Rajendran , C . 2003 . Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs . Int. J. Prod. Res. , 41 : 4453 – 4486 .
   Web of Science ®Google Scholar
• Trigeiro , WW . 1987 . A dual-cost heuristic for the capacitated lot sizing problem . IIE Trans. , 19 : 67 – 72 .
   Web of Science ®Google Scholar
• Yang , B , Geunes , J and O’Brien , WJ . 2004 . A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling . Comput. Oper. Res. , 31 : 1273 – 1301 .
   Web of Science ®Google Scholar
• Zozom , A , Hodgson , TJ , King , RE , Weintraub , AJ and Cormier , D . 2003 . Integrated job release and shop-floor scheduling to minimize WIP and meet due-dates . Int. J. Prod. Res. , 41 : 31 – 45 .
   Web of Science ®Google Scholar