New scheduling algorithms and digital tool for dynamic permutation flowshop with newly arrived order

References

• Akturk, M. S., and E. Gorgulu. 1999. “Match-up Scheduling under a Machine Breakdown.” European Journal of Operational Research 112 (1): 81–97.10.1016/S0377-2217(97)00396-2
   Web of Science ®Google Scholar
• Aytug, H., M. A. Lawley, K. McKay, S. Mohan, and R. Uzsoy. 2005. “Executing Production Schedules in the Face of Uncertainties: A Review and Some Future Directions.” European Journal of Operational Research 161 (1): 86–110.10.1016/j.ejor.2003.08.027
   Web of Science ®Google Scholar
• Bean, J. C., and J. R. Birge. 1986. “Match-up Real-time Scheduling.” In Proceedings of the Symposium on Real-time Optimization in Automated Manufacturing Facilities, National Bureau of Standards, Special Publication 724: 197–212.
   Google Scholar
• Branke, J., and D. C. Mattfeld. 2005. “Anticipation and Flexibility in Dynamic Scheduling.” International Journal of Production Research 43 (15): 3103–3129.10.1080/00207540500077140
   Web of Science ®Google Scholar
• Chaari, T., S. Chaabane, T. Loukil, and D. Trentesaux. 2011. “A Genetic Algorithm for Robust Hybrid Flow Shop Scheduling.” International Journal of Computer Integrated Manufacturing 24 (9): 821–833.10.1080/0951192X.2011.575181
   Web of Science ®Google Scholar
• Cheng, T. C. E., C. T. Ng, and J. J. Yuan. 2006. “Multi-agent Scheduling on a Single Machine to Minimize Total Weighted Number of Tardy Jobs.” Theoretical Computer Science 362 (1–3): 273–281. Elsevier.
   Web of Science ®Google Scholar
• Dong, X., H. Huang, and P. Chen. 2008. “An Improved NEH-based Heuristic for the Permutation Flowshop Problem.” Computers & Operations Research 35 (12): 3962–3968.10.1016/j.cor.2007.05.005
   Web of Science ®Google Scholar
• El-Bouri, A., S. Balakrishnan, and N. Popplewell. 2008. “Cooperative Dispatching for Minimizing Mean Flowtime in a Dynamic Flowshop.” International Journal of Production Economics 113 (2): 819–833.10.1016/j.ijpe.2007.11.005
   Web of Science ®Google Scholar
• Feng, Q., B. Fan, S. Li, and W. Shang. 2015. “Two-agent Scheduling with Rejection on a Single Machine.” Applied Mathematical Modelling 39 (3–4): 1183–1193.10.1016/j.apm.2014.07.024
   Web of Science ®Google Scholar
• Graham, R. L., E. L. 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.10.1016/S0167-5060(08)70356-X
   Google Scholar
• Herroelen, W., and R. Leus. 2004. “Robust and Reactive Project Scheduling: A Review and Classification of Procedures.” International Journal of Production Research 42 (8): 1599–1620.10.1080/00207540310001638055
   Web of Science ®Google Scholar
• Johnson, S. M. 1954. “Optimal Two and Three-stage Production Schedules with Setup times.” Naval Research Logistics Quarterly 1: 61–68.10.1002/(ISSN)1931-9193
   Google Scholar
• Kalczynski, P. J., and J. Kamburowski. 2008. “An Improved NEH Heuristic to Minimize Makespan in Permutation Flow Shops.” Computers & Operations Research 35 (9): 3001–3008.10.1016/j.cor.2007.01.020
   Web of Science ®Google Scholar
• Kalczynski, P. J., and J. Kamburowski. 2009. “An Empirical Analysis of the Optimality Rate of Flow Shop Heuristics.” European Journal of Operational Research 198 (1): 93–101.10.1016/j.ejor.2008.08.021
   Web of Science ®Google Scholar
• Kianfar, K., S. M. T. Fatemi Ghomi, and B. Karimi. 2009. “New Dispatching Rules to Minimize Rejection and Tardiness Costs in a Dynamic Flexible Flow Shop.” The International Journal of Advanced Manufacturing Technology 45 (7–8): 759–771.10.1007/s00170-009-2015-x
   Web of Science ®Google Scholar
• Kovalyov, M. Y., A. Oulamara, and A. Soukhal. 2015. “Two-agent Scheduling with Agent Specific Batches on an Unbounded Serial Batching Machine.” Journal of Scheduling 18 (4): 423–434.10.1007/s10951-014-0410-0
   Web of Science ®Google Scholar
• Li, M., L. Yao, J. Yang, and Z. Wang. 2015. “Due Date Assignment and Dynamic Scheduling of One-of-a-Kind Assembly Production with Uncertain Processing Time.” International Journal of Computer Integrated Manufacturing 28 (6): 616–627.10.1080/0951192X.2014.900859
   Web of Science ®Google Scholar
• Liao, L., and C. Huang. 2010. “Tabu Search for Non-permutation Flowshop Scheduling Problem with Minimizing Total Tardiness.” Applied Mathematics and Computation 217 (2): 557–567.10.1016/j.amc.2010.05.089
   Web of Science ®Google Scholar
• Liu, W., Y. Jin, and M. Price. 2015. “New Priority Rule for NEH Algorithm to Minimize Makespan in Flowshop Scheduling.” 32nd International Manufacturing Conference, Belfast, UK.
   Google Scholar
• Liu, W., Y. Jin, and M. Price. 2016. “A New Nawaz–Enscore–Ham-based Heuristic for Permutation Flow-shop Problems with Bicriteria of Makespan and Machine Idle Time.” Engineering Optimization 48 (10): 1808–1822.10.1080/0305215X.2016.1141202
   Web of Science ®Google Scholar
• Lodree, E., W. Jang, and C. M. Klein. 2004. “A New Rule for Minimizing the Number of Tardy Jobs in Dynamic Flow Shops.” European Journal of Operational Research 159 (1): 258–263.10.1016/S0377-2217(03)00404-1
   Web of Science ®Google Scholar
• Moratori, P., S. Petrovic, and A. Vázquez. 2008. “Match-up Strategies for Job Shop Rescheduling.” In New Frontiers in Applied Artificial Intelligence, Lecture Notes in Computer Science, 5027:119–128. Berlin: Springer-Verlag.
   Google Scholar
• Moratori, P., S. Petrovic, and J. A. Vázquez-Rodríguez. 2012. “Match-up Approaches to a Dynamic Rescheduling Problem.” International Journal of Production Research 50 (1): 261–276.10.1080/00207543.2011.571458
   Web of Science ®Google Scholar
• Nandi, A., and P. Rogers. 2004. “Using Simulation to Make Order Acceptance/Rejection Decisions.” Simulation 80 (3): 131–142.10.1177/0037549704045046
   Google Scholar
• Nawaz, M., E. E. Enscore Jr., and I. Ham. 1983. “A Heuristic Algorithm for the M-machine, N-job Flow-shop Sequencing Problem.” Omega 11 (1): 91–95.10.1016/0305-0483(83)90088-9
   Web of Science ®Google Scholar
• O’Donovan, R., R. Uzsoy, and K. N. McKay. 1999. “Predictable Scheduling of a Single Machine with Breakdowns and Sensitive Jobs.” International Journal of Production Research 37 (18): 4217–4233.10.1080/002075499189745
   Web of Science ®Google Scholar
• Perez-Gonzalez, P., and J. M. Framinan. 2009. “Scheduling Permutation Flowshops with Initial Availability Constraint: Analysis of Solutions and Constructive Heuristics.” Computers and Operations Research 36 (10): 2866–2876.10.1016/j.cor.2008.12.018
   Web of Science ®Google Scholar
• Perez-Gonzalez, P., and J. M. Framinan. 2010. “Setting a Common Due Date in a Constrained Flowshop: A Variable Neighbourhood Search Approach.” Computers & Operations Research 37 (10): 1740–1748.10.1016/j.cor.2010.01.002
   Web of Science ®Google Scholar
• Perez-Gonzalez, P., and J. M. Framinan. 2015. “Assessing Scheduling Policies in a Permutation Flowshop with Common Due Dates.” International Journal of Production Research 53 (19): 5742–5754.10.1080/00207543.2014.994077
   Web of Science ®Google Scholar
• Rahman, H. F., R. Sarker, and D. Essam. 2015. “A Real-time Order Acceptance and Scheduling Approach for Permutation Flow Shop Problems.” European Journal of Operational Research 247 (2): 488–503.10.1016/j.ejor.2015.06.018
   Web of Science ®Google Scholar
• Rajendran, C., and O. Holthaus. 1999. “A Comparative Study of Dispatching Rules in Dynamic Flowshops and Jobshops.” European Journal of Operational Research 116: 156–170.10.1016/S0377-2217(98)00023-X
   Web of Science ®Google Scholar
• Safari, E., and S. J. Sadjadi. 2011. “A Hybrid Method for Flowshops Scheduling with Condition-based Maintenance Constraint and Machines Breakdown.” Expert Systems with Applications 38 (3): 2020–2029.10.1016/j.eswa.2010.07.138
   Web of Science ®Google Scholar
• Taillard, E. 1993. “Benchmarks for Basic Scheduling Problems.” European Journal of Operational Research 64: 278–285.10.1016/0377-2217(93)90182-M
   Web of Science ®Google Scholar
• Taillard, E. 2015. “Summary of Best Known Lower and Upper Bounds of Taillard’s Instances.” Accessed May 22. http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/flowshop.dir/best_lb_up.txt
   Google Scholar
• Tamer Unal, A., R. Uzsoy, and A. S. Kiran. 1997. “Rescheduling on a Single Machine with Part-type Dependent Setup times and Deadlines.” Annals of Operations Research 70: 93–113.10.1023/A:1018955111939
   Web of Science ®Google Scholar
• Vallada, E., R. Ruiz, and J. M. Framinan. 2015. “New Hard Benchmark for Flowshop Scheduling Problems Minimising Makespan.” European Journal of Operational Research 240 (3): 666–677.10.1016/j.ejor.2014.07.033
   Web of Science ®Google Scholar
• Vasiljevic, D., and M. Danilovic. 2015. “Handling Ties in Heuristics for the Permutation Flow Shop Scheduling Problem.” Journal of Manufacturing Systems 35: 1–9.10.1016/j.jmsy.2014.11.011
   Web of Science ®Google Scholar
• Wu, C. W., K. N. Brown, and J. C. Beck. 2009. “Scheduling with Uncertain Durations: Modeling β-robust Scheduling with Constraints.” Computers & Operations Research 36 (8): 2348–2356.10.1016/j.cor.2008.08.008
   Web of Science ®Google Scholar
• Xia, Y., B. Chen, and J. Yue. 2008. “Job Sequencing and Due Date Assignment in a Single Machine Shop with Uncertain Processing times.” European Journal of Operational Research 184 (1): 63–75.10.1016/j.ejor.2006.10.058
   Web of Science ®Google Scholar
• Zhu, H., and H. Zhou. 2014. “Single Machine Predictive Scheduling Using Inserted Idle times.” Journal of Applied Mathematics. Article ID 304808, 5 pages.
   Google Scholar