Dynamic set-up rules for hybrid flow shop scheduling with parallel batching machines

References

• Abu-suleiman, A., D. Prattz, and B. Boardman. 2005. “The Modified Critical Ratio: Towards Sequencing with a Continuous Decision Domain.” International Journal of Production Research 43 (15): 3287–3296.
   Web of Science ®Google Scholar
• Allahverdi, A., C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov. 2008. “A Survey of Scheduling Problems with Setup Times or Costs.” European Journal of Operational Research 187 (3): 985–1032.
   Web of Science ®Google Scholar
• Berry, W. L., and V. Rao. 1975. “Critical Ratio Scheduling: An Experimental Analysis.” Management Science 22: 192–201.
   Web of Science ®Google Scholar
• Chand, S., R. Traub, and R. Uzsoy. 1997. “Rolling Horizon Procedures for the Single Machine Deterministic Total Completion Time Scheduling Problem with Release Dates.” Annals of Operations Research 70: 115–125.
   Web of Science ®Google Scholar
• Chiang, T.-C., and L.-C. Fu. 2007. “Using Dispatching Rules for Job Shop Scheduling with Due Date-Based Objectives.” International Journal of Production Research 45 (14): 3245–3262.
   Web of Science ®Google Scholar
• Chiang, T.-C., and L.-C. Fu. 2009. “Using a Family of Critical Ratio-Based Approaches to Minimize the Number of Tardy Jobs in the Job Shop with Sequence Dependent Setup Times.” European Journal of Operational Research 196: 78–92.
   Web of Science ®Google Scholar
• Colledani, M., and T. Tolio. 2005. “A Decomposition Method to Support the Configuration/Reconfiguration of Production Systems.” CIRP Annals - Manufacturing Technology 54 (1): 441–444.
   Web of Science ®Google Scholar
• Garcia, J. M., and S. Lozano. 2005. “Production and Delivery Scheduling Problem with Time Windows.” Computers & Industrial Engineering 48 (4): 733–742.
   Web of Science ®Google Scholar
• Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W.H. Freeman.
   Google Scholar
• Graham, R. L., E. R. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.
   Google Scholar
• Kanet, J. J., and X. Li. 2004. “A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness.” Journal of Scheduling 7 (4): 261–276.
   Web of Science ®Google Scholar
• Kapanoglu, M., and M. Alikalfa. 2011. “Learning IF–THEN Priority Rules for Dynamic Job Shops Using Genetic Algorithms.” Robotics and Computer-Integrated Manufacturing 27: 47–55.
   Web of Science ®Google Scholar
• Lee, Y. H., and M. Pinedo. 1997. “Scheduling Jobs on Parallel Machines with Sequence-Dependent Setup Times.” European Journal of Operational Research 100 (3): 464–474.
   Web of Science ®Google Scholar
• Liao, C. J., L. M. Liao, and C. T. Tseng. 2006. “A Performance Evaluation of Permutation vs. Non-Permutation Schedules in a Flowshop.” International Journal of Production Research 44: 4297–4309.
   Web of Science ®Google Scholar
• Mason, S. J., J. W. Fowler, and W. Matthew Carlyle. 2002. “A Modified Shifting Bottleneck Heuristic for Minimizing Total Weighted Tardiness in Complex Job Shops.” Journal of Scheduling 5 (3): 247–262.
   Web of Science ®Google Scholar
• Mönch, L., H. Balasubramanian, J. W. Fowler, and M. E. Pfund. 2005. “Heuristic Scheduling of Jobs on Parallel Batch Machines with Incompatible Job Families and Unequal Ready Times.” Computers & Operations Research 32 (11): 2731–2750.
   Web of Science ®Google Scholar
• Perez, I. C., J. W. Fowler, and W. M. Carlyle. 2005. “Minimizing Total Weighted Tardiness on a Single Batch Process Machine with Incompatible Job Families.” Computers & Operations Research 32 (2): 327–341.
   Web of Science ®Google Scholar
• Pfund, M. E., S. J. Mason, and J. W. Fowler. 2006. “Semiconductor Manufacturing Scheduling and Dispatching.” In Handbook of Production Scheduling, 213–241. New York: Springer.
   Google Scholar
• Pfund, M., J. W. Fowler, A. Gadkan, and Y. Chen. 2008. “Scheduling Jobs on Parallel Machines with Setup Times and Ready Times.” Computers & Industrial Engineering 54 (4): 764–782.
   Web of Science ®Google Scholar
• Pickardt, C. W., T. Hildebrandt, J. Branke, J. Heger, and B. Scholz-Reiter. 2013. “Evolutionary Generation of Dispatching Rule Sets for Complex Dynamic Scheduling Problems.” International Journal of Production Economics 145 (1): 67–77. doi:10.1016/j.ijpe.2012.10.016.
   Web of Science ®Google Scholar
• Ribas, I., R. Leisten, and J. M. Framinan. 2010. “Review and Classification of Hybrid Flowshop Scheduling Problems from a Production System and a Solutions Procedure Perspective.” Computers & Operations Research 37: 1439–1454.
   Web of Science ®Google Scholar
• Rossi, A., and M. Lanzetta. 2013a. “Scheduling Flow Lines with Buffers by Ant Colony Digraph.” Expert Systems with Applications 40 (9): 3328–3340. doi:10.1016/j.eswa.2012.12.041.
   Web of Science ®Google Scholar
• Rossi, A., and M. Lanzetta. 2013b. “Native Metaheuristics for Non-permutation Flowshop Scheduling.” Journal of Intelligent Manufacturing (JIMS). doi:10.1007/s10845-012-0724-8.
   Google Scholar
• Rossi, A., and M. Lanzetta. 2013. “Non-permutation Flow Line Scheduling by Ant Colony Optimization.” Artificial Intelligence for Engineering Design, Analysis and Manufacturing (AI EDAM). doi:10.1017/S0890060413000176.
   Web of Science ®Google Scholar
• Rossi, A., A. Puppato, and M. Lanzetta. 2013. “Heuristics for Scheduling a Two-Stage Hybrid Flowshop with Parallel Batching Machines: An Application on Hospital Sterilization Plant.” International Journal of Production Research 51 (8): 2363–2376. doi:10.1080/00207543.2012.737942.
   Web of Science ®Google Scholar
• Ruiz, R., and C. Maroto. 2006. “A Genetic Algorithm for Hybrid Flowshops with Sequence Dependent Setup Times and Machine Eligibility.” European Journal of Operartion Research 169 (3): 781–800.
   Web of Science ®Google Scholar
• Shafaei, R., and P. Brunn. 1999. “Workshop Scheduling Using Practical (Inaccurate) Data Part 1: The Performance of Heuristic Scheduling Rules in a Dynamic Job Shop Environment Using a Rolling Time Horizon Approach.” International Journal of Production Research 37 (17): 3913–3925.
   Web of Science ®Google Scholar
• Tandon, M., P. T. Cummings, and M. D. LeVan. 1991. “Flowshop Sequencing with Non-Permutation Schedules.” Computers and Industrial Engineering 15 (8): 601–607.
   Google Scholar
• Ying, K.-C., J. N. D. Gupta, S.-W. Lin, and Z.-J. Lee. 2010. “Permutation and Non-Permutation Schedules for the Flowline Manufacturing Cell with Sequence Dependent Family Setups.” International Journal of Production Research 48 (8): 2169–2184.
   Web of Science ®Google Scholar