Stochastic customer order scheduling with setup times to minimize expected cycle time

References

• Ahmadi, Reza, Uttarayan Bagchi, and Thomas A. Roemer. 2005. “Coordinated Scheduling of Customer Orders for Quick Response.” Naval Research Logistics (NRL) 52 (6): 493–512.
   Web of Science ®Google Scholar
• Allahverdi, Ali, Jatinder N. D. Gupta, and Tariq Aldowaisan. 1999. “A Review of Scheduling Research Involving Setup Considerations.” Omega 27 (2): 219–239.
   Web of Science ®Google Scholar
• Allahverdi, Ali, C. T. Ng, T. C. Edwin Cheng, and Mikhail 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
• Allahverdi, Ali, and H. M. Soroush. 2008. “The Significance of Reducing Setup Times/Setup Costs.” European Journal of Operational Research 187 (3): 978–984.
   Web of Science ®Google Scholar
• Arnaout, Jean-Paul, Rami Musa, and Ghaith Rabadi. 2014. “A Two-stage Ant Colony Optimization Algorithm to Minimize the Makespan on Unrelated Parallel Machines -- Part II: Enhancements and Experimentations.” Journal of Intelligent Manufacturing 25 (1): 43–53.
   Web of Science ®Google Scholar
• Arnaout, Jean-Paul, Ghaith Rabadi, and Ji Hyon Mun. 2006. “A Dynamic Heuristic for the Stochastic Unrelated Parallel Machine Scheduling Problem.” International Journal of Operations Research 3 (2): 136–143.
   Google Scholar
• Arnaout, Jean-Paul, Ghaith Rabadi, and Rami Musa. 2010. “A Two-stage Ant Colony Optimization Algorithm to Minimize the Makespan on Unrelated Parallel Machines with Sequence-dependent Setup Times.” Journal of Intelligent Manufacturing 21 (6): 693–701.
   Web of Science ®Google Scholar
• Baccelli, François, and Armand M. Makowski. 1989. “Queueing Models for Systems with Synchronization Constraints.” Proceedings of the IEEE 77 (1): 138–161.
   Web of Science ®Google Scholar
• Baccelli, Francois, Armand M. Makowski, and Adam Shwartz. 1989. “The Fork--Join Queue and Related Systems with Synchronization Constraints: Stochastic Ordering and Computable Bounds.” Advances in Applied Probability 21 (3): 629–660.
   Web of Science ®Google Scholar
• Bank, Jan, and Frank Werner. 2001. “Heuristic Algorithms for Unrelated Parallel Machine Scheduling with a Common Due Date, Release Dates, and Linear Earliness and Tardiness Penalties.” Mathematical and Computer Modelling 33 (4): 363–383.
   Google Scholar
• Blocher, James D., and Dilip Chhajed. 1996. “The Customer Order Lead-time Problem on Parallel Machines.” Naval Research Logistics (NRL) 43 (5): 629–654.
   Web of Science ®Google Scholar
• Chen, Jeng-Fung. 2009. “Scheduling on Unrelated Parallel Machines with Sequence-and Machine-dependent Setup Times and Due-date Constraints.” The International Journal of Advanced Manufacturing Technology 44 (11): 1204–1212.
   Web of Science ®Google Scholar
• Cheng, T. C. Edwin, Jatinder N. D. Edwin, and Guoqing Wang. 2000. “A Review of Flowshop Scheduling Research with Setup Times.” Production and Operations Management 9 (3): 262–282.
   Web of Science ®Google Scholar
• Coffman Jr, E. G. Co, M. R. Garey, and D. S. Johnson. 1996. “Approximation Algorithms for Bin Packing: A Survey.” In Approximation Algorithms for NP-Hard Problems, edited by Dorit S. Hochbaum, 46–93. Boston, MA: PWS Publishing Co.
   Google Scholar
• Coffman Jr, Edward G., Michael R. Garey, and David S. Johnson. 1984. “Approximation Algorithms for Bin-packing -- An Updated Survey.” In Algorithm Design for Computer System Design, edited by G. Ausiello, M. Lucertini, and P. Serafini, 49–106. New York: Springer.
   Google Scholar
• Conway, Richard W., William L. Maxwell, and Louis W. Miller. 2012. Theory of Scheduling. New York: Courier Corporation.
   Google Scholar
• Garey, Michael R., and David S. Johnson. 1981. “Approximation Algorithms for Bin Packing Problems: A Survey.” In Analysis and Design of Algorithms in Combinatorial Optimization, edited by G. Ausiello, and M. Lucertini, 147–172. New York: Springer.
   Google Scholar
• Helal, Magdy, Ghaith Rabadi, and Ameer Al-Salem. 2006. “A Tabu Search Algorithm to Minimize the Makespan for the Unrelated Parallel Machines Scheduling Problem with Setup Times.” International Journal of Operations Research 3 (3): 182–192.
   Google Scholar
• Hopp, Wallace J., and Mark L. Spearman. 2008. Factory Physics. Vol. 2. New York: McGraw-Hill/Irwin New York.
   Google Scholar
• Julien, F. M., and M. J. Magazine. 1990. “Scheduling Customer Orders -- An Alternative Production Scheduling Approach.” Journal of Manufacturing and Operations Management 3 (3): 177–199.
   Google Scholar
• Juman, Z. A. M. S., and M. A. Hoque. 2014. “A Heuristic Solution Technique to Attain the Minimal Total Cost Bounds of Transporting a Homogeneous Product with Varying Demands and Supplies.” European Journal of Operational Research 239 (1): 146–156.
   Web of Science ®Google Scholar
• Juman, Z. A. M. S., and M. A. Hoque. 2015. “An Efficient Heuristic to Obtain a Better Initial Feasible Solution to the Transportation Problem.” Applied Soft Computing 34: 813–826.
   Web of Science ®Google Scholar
• Jungwattanakit, Jitti, Manop Reodecha, Paveena Chaovalitwongse, and Frank Werner. 2008. “Algorithms for Flexible Flow Shop Problems with Unrelated Parallel Machines, Setup Times, and Dual Criteria.” The International Journal of Advanced Manufacturing Technology 37 (3–4): 354–370.
   Web of Science ®Google Scholar
• Karmarkar, Narendra. 1984. “A New Polynomial-time Algorithm for Linear Programming.” In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, 302–311. Washington, DC: ACM.
   Google Scholar
• Kim, Cheeha, and Ashok K. Agrawala. 1989. “Analysis of the Fork--Join Queue.” IEEE Transactions on Computers 38 (2): 250–255.
   Web of Science ®Google Scholar
• Kim, S. C., and P. M. Bobrowski. 1997. “Scheduling Jobs with Uncertain Setup Times and Sequence Dependency.” Omega 25 (4): 437–447.
   Web of Science ®Google Scholar
• Kim, Dong-Won, Kyong-Hee Kim, Wooseung Jang, and F. Frank Chen. 2002. “Unrelated Parallel Machine Scheduling with Setup Times Using Simulated Annealing.” Robotics and Computer-Integrated Manufacturing 18 (3): 223–231.
   Web of Science ®Google Scholar
• Kim, Dong-Won, Dong-Gil Na, and F. Frank Chen. 2003. “Unrelated Parallel Machine Scheduling with Setup Times and a Total Weighted Tardiness Objective.” Robotics and Computer-Integrated Manufacturing 19 (1): 173–181.
   Web of Science ®Google Scholar
• Lee, Ik Sun. 2013. “Minimizing Total Tardiness for the Order Scheduling Problem.” International Journal of Production Economics 144 (1): 128–134.
   Web of Science ®Google Scholar
• Lee, Jae-Ho, Yu Jae-Min, and Dong-Ho Lee. 2013. “A Tabu Search Algorithm for Unrelated Parallel Machine Scheduling with Sequence-and Machine-dependent Setups: Minimizing Total Tardiness.” The International Journal of Advanced Manufacturing Technology 69 (9–12): 2081–2089.
   Web of Science ®Google Scholar
• Leung, Joseph Y. T., Haibing Li, and Michael Pinedo. 2005a. “Order Scheduling in an Environment with Dedicated Resources in Parallel.” Journal of Scheduling 8 (5): 355–386.
   Web of Science ®Google Scholar
• Leung, Joseph Y. T., Haibing Li, and Michael Pinedo. 2005b. “Order Scheduling Models: An Overview.” In Multidisciplinary Scheduling: Theory and Applications, edited by G. Kendall, E. Burke, S. Petrovic, and M. Gendreau, 37–53. Nottingham: Springer.
   Google Scholar
• Leung, Joseph Y. T., Haibing Li, and Michael Pinedo. 2006. “Scheduling Orders for Multiple Product Types with Due Date Related Objectives.” European Journal of Operational Research 168 (2): 370–389.
   Web of Science ®Google Scholar
• Leung, Joseph Y. T., Haibing Li, and Michael Pinedo. 2007. “Scheduling Orders for Multiple Product Types to Minimize Total Weighted Completion Time.” Discrete Applied Mathematics 155 (8): 945–970.
   Web of Science ®Google Scholar
• Lin, Shih-Wei, Lu Chung-Cheng, and Kuo-Ching Ying. 2011. “Minimization of Total Tardiness on Unrelated Parallel Machines with Sequence-and Machine-dependent Setup Times under Due Date Constraints.” The International Journal of Advanced Manufacturing Technology 53 (1–4): 353–361.
   Web of Science ®Google Scholar
• Lin, Yang-Kuei, and Feng-Yu Hsieh. 2014. “Unrelated Parallel Machine Scheduling with Setup Times and Ready Times.” International Journal of Production Research 52 (4): 1200–1214.
   Web of Science ®Google Scholar
• Lodi, Andrea, Silvano Martello, and Michele Monaci. 2002. “Two-dimensional Packing Problems: A Survey.” European Journal of Operational Research 141 (2): 241–252.
   Web of Science ®Google Scholar
• Lodi, Andrea, Silvano Martello, and Daniele Vigo. 2002. “Recent Advances on Two-dimensional Bin Packing Problems.” Discrete Applied Mathematics 123 (1): 379–396.
   Web of Science ®Google Scholar
• Logendran, Rasaratnam, Brent McDonell, and Byran Smucker. 2007. “Scheduling Unrelated Parallel Machines with Sequence-dependent Setups.” Computers & Operations Research 34 (11): 3420–3438.
   Web of Science ®Google Scholar
• Logendran, Rasaratnam, and Fenny Subur. 2004. “Unrelated Parallel Machine Scheduling with Job Splitting.” IIE Transactions 36 (4): 359–372.
   Web of Science ®Google Scholar
• Martello, Silvano, David Pisinger, and Daniele Vigo. 2000. “The Three-dimensional Bin Packing Problem.” Operations Research 48 (2): 256–267.
   Web of Science ®Google Scholar
• Ng, C. T., T. C. Edwin Cheng, and J. J. Yuan. 2003. “Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs.” Journal of Scheduling 6 (4): 405–412.
   Web of Science ®Google Scholar
• Og, Ceyda, F. Sibel Salman, and Zehra Bilgintürk Yalçın. 2010. “Order Acceptance and Scheduling Decisions in Make-to-Order Systems.” International Journal of Production Economics 125 (1): 200–211.
   Web of Science ®Google Scholar
• Rabadi, Ghaith, Reinaldo J. Moraga, and Ameer Al-Salem. 2006. “Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times.” Journal of Intelligent Manufacturing 17 (1): 85–97.
   Web of Science ®Google Scholar
• Radhakrishnan, Sanjay, and Jose A. Ventura. 2000. “Simulated Annealing for Parallel Machine Scheduling with Earliness-tardiness Penalties and Sequence-dependent Set-up Times.” International Journal of Production Research 38 (10): 2233–2252.
   Web of Science ®Google Scholar
• Roemer, Thomas A. 2006. “A Note on the Complexity of the Concurrent Open Shop Problem.” Journal of Scheduling 9 (4): 389–396.
   Web of Science ®Google Scholar
• Stalk, George. 1988. “Time -- The Next Source of Competitive Advantage.” Harvard Business Review 66 (4): 41–51.
   Web of Science ®Google Scholar
• Su, Ling-Huey, Ping-Shun Chen, and Szu-Yin Chen. 2013. “Scheduling on Parallel Machines to Minimise Maximum Lateness for the Customer Order Problem.” International Journal of Systems Science 44 (5): 926–936.
   Web of Science ®Google Scholar
• Tahar, Djamel Nait, Farouk Yalaoui, Chengbin Chu, and Lionel Amodeo. 2006. “A Linear Programming Approach for Identical Parallel Machine Scheduling with Job Splitting and Sequence-dependent Setup Times.” International Journal of Production Economics 99 (1): 63–73.
   Web of Science ®Google Scholar
• Wang, Guoqing, and T. C. Edwin Cheng. 2007. “Customer Order Scheduling to Minimize Total Weighted Completion Time.” Omega 35 (5): 623–626.
   Web of Science ®Google Scholar
• Welch, Peter D. 1983. “The Statistical Analysis of Simulation Results.” The Computer Performance Modeling Handbook 22: 268–328.
   Google Scholar
• Weng, Michael X., Lu John, and Haiying Ren. 2001. “Unrelated Parallel Machine Scheduling with Setup Consideration and a Total Weighted Completion Time Objective.” International Journal of Production Economics 70 (3): 215–226.
   Web of Science ®Google Scholar
• Xing, Wenxun, and Jiawei Zhang. 2000. “Parallel Machine Scheduling with Splitting Jobs.” Discrete Applied Mathematics 103 (1): 259–269.
   Web of Science ®Google Scholar
• Xu, Xiaoyun, Ying Ma, Zihuan Zhou, and Yaping Zhao. 2013. “Customer Order Scheduling on Unrelated Parallel Machines to Minimize Total Completion Time.” IEEE Transactions on Automation Science and Engineering 12 (1): 244–257.
   Web of Science ®Google Scholar
• Xu, Xiaoyun, Yaping Zhao, Haidong Li, and Manxi Wu. 2015. “Stochastic Customer Order Scheduling to Maximize Throughput.” In 2015 IEEE International Conference on Automation Science and Engineering (CASE), 665–670. Gothenburg: IEEE.
   Google Scholar
• Xu, Xiaoyun, Yaping Zhao, Haidong Li, Zihuan Zhou, and Yanni Liu. 2015b. “Stochastic Customer Order Scheduling Using Simulation-based Genetic Algorithm.” In Proceedings of the 2015 Winter Simulation Conference, 2317–2328. Huntington Beach, CA: IEEE Press.
   Google Scholar
• Xu, Xiaoyun, Yaping Zhao, Manxi Wu, Zihuan Zhao, Ying Ma, and Yanni Liu. 2016. “Stochastic Customer Order Scheduling to Minimize Long-run Expected Order Cycle Time.” Annals of Operations Research 1–24.
   Google Scholar
• Yalaoui, Farouk, and Chengbin Chu. 2003. “An Efficient Heuristic Approach for Parallel Machine Scheduling with Job Splitting and Sequence-dependent Setup Times.” IIE Transactions 35 (2): 183–190.
   Web of Science ®Google Scholar
• Yang, Jaehwan. 2005. “The Complexity of Customer Order Scheduling Problems on Parallel Machines.” Computers & Operations Research 32 (7): 1921–1939.
   Web of Science ®Google Scholar
• Yang, Jaehwan, and Marc E. Posner. 2005. “Scheduling Parallel Machines for the Customer Order Problem.” Journal of Scheduling 8 (1): 49–74.
   Web of Science ®Google Scholar
• Zhao, Yaping, Xiaoyun Xu, and Haidong Li. 2017. “Throughputs Maximization of Stochastic Customer Orders under Two Production Schemes.” IEEE Transactions on Automation Science and Engineering 14 (2): 745–757.
   Web of Science ®Google Scholar
• Zhao, Yaping, Xiaoyun Xu, Haidong Li, and Yanni Liu. 2016. “Prioritized Customer Order Scheduling to Maximize Throughput.” European Journal of Operational Research 255 (2): 345–356.
   Web of Science ®Google Scholar