358
Views
13
CrossRef citations to date
0
Altmetric
Original Articles

Integrated scheduling on parallel batch processing machines with non-identical capacities

, , &
Pages 715-730 | Received 05 Aug 2018, Accepted 25 Apr 2019, Published online: 22 May 2019

References

  • Arroyo, José Elias C., and Joseph Y.-T. Leung. 2017. “Scheduling Unrelated Parallel Batch Processing Machines with Non-Identical Job Sizes and Unequal Ready Times.” Computers & Operations Research 78: 117–128.
  • Chandru, Vijaya, Chung-Yee Lee, and Reha Uzsoy. 1993. “Minimizing Total Completion Time on Batch Processing Machines.” International Journal of Production Research 31 (9): 2097–2121.
  • Chang, Ping-Yu, Purushothaman Damodaran, and Sharif Melouk. 2004. “Minimizing Makespan on Parallel Batch Processing Machines.” International Journal of Production Research 42 (19): 4211–4220.
  • Chang, Yung-Chia, Vincent C. Li, and Chia-Ju Chiang. 2014. “An Ant Colony Optimization Heuristic for an Integrated Production and Distribution Scheduling Problem.” Engineering Optimization 46 (4): 503–520.
  • Chen, Zhi-Long. 2010. “Integrated Production and Outbound Distribution Scheduling: Review and Extensions.” Operations Research 58 (1): 130–148.
  • Chen, Zhi-Long, and Nicholas G. Hall. 2007. “Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems.” Operations Research 55 (6): 1072–1089.
  • Chen, Zhi-Long, and Guruprasad Pundoor. 2006. “Order Assignment and Scheduling in a Supply Chain.” Operations Research 54 (3): 555–572.
  • Chen, Zhi-Long, and George L. Vairaktarakis. 2005. “Integrated Scheduling of Production and Distribution Operations.” Management Science 51 (4): 614–628.
  • Cheng, Jun-Heng, Feng Chu, Ming Liu, Peng Wu, and Wei-Li Xia. 2017. “Bi-Criteria Single-Machine Batch Scheduling with Machine On/Off Switching Under Time-of-Use Tariffs.” Computers & Industrial Engineering 112: 721–734.
  • Cheng, Ba-Yi, Joseph Y.-T. Leung, and Kai Li. 2017. “Integrated Scheduling on a Batch Machine to Minimize Production, Inventory and Distribution Costs.” European Journal of Operational Research 258 (1): 104–112.
  • Cheng, Ba-Yi, Joseph Y.-T. Leung, Kai Li, and Shan-Lin Yang. 2015. “Single Batch Machine Scheduling with Deliveries.” Naval Research Logistics 62 (6): 470–482.
  • Coffman, 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, 49–106. Vienna: Springer-Verlag. doi:10.1007/978-3-7091-4338-4.
  • Damodaran, Purushothaman, and Ping-Yu Chang. 2008. “Heuristics to Minimize Makespan of Parallel Batch Processing Machines.” International Journal of Advanced Manufacturing Technology 37 (9–10): 1005–1013.
  • Damodaran, Purushothaman, Don A. Diyadawagamage, Omar Ghrayeb, and Mario C. Vélez-Gallego. 2012. “A Particle Swarm Optimization Algorithm for Minimizing Makespan of Nonidentical Parallel Batch Processing Machines.” International Journal of Advanced Manufacturing Technology 58 (9–12): 1131–1140.
  • Ghazvini, Fariborz J., and Lionel Dupont. 1998. “Minimizing Mean Flow Times Criteria on a Single Batch Processing Machine with Non-Identical Jobs Sizes.” International Journal of Production Economics 55 (3): 273–280.
  • Graham, Ronald L., Eugene L. Lawler, Jan K. Lenstra, and Alexander H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.
  • Guo, Peng, Wen-Ming Cheng, and Yi Wang. 2015. “Parallel Machine Scheduling with Step-Deteriorating Jobs and Setup Times by a Hybrid Discrete Cuckoo Search Algorithm.” Engineering Optimization 47 (11): 1564–1585.
  • Hall, Nicholas G., and Chris N. Potts. 2003. “Supply Chain Scheduling: Batching and Delivery.” Operations Research 51 (4): 566–584.
  • Ikura, Yoshiro, and Mark Gimple. 1986. “Efficient Scheduling Algorithms for a Single Batch Processing Machine.” Operations Research Letters 5 (2): 61–65.
  • Jia, Zhao-hong, and Joseph Y.-T. Leung. 2015. “A Meta-Heuristic to Minimize Makespan for Parallel Batch Machines with Arbitrary Job Sizes.” European Journal of Operational Research 240 (3): 649–665.
  • Jia, Zhao-hong, Kai Li, and Joseph Y.-T. Leung. 2015. “Effective Heuristic for Makespan Minimization in Parallel Batch Machines with Non-Identical Capacities.” International Journal of Production Economics 169: 1–10.
  • Jia, Zhao-hong, Xiao-Hao Li, and Joseph Y.-T. Leung. 2017. “Minimizing Makespan for Arbitrary Size Jobs with Release Times on P-Batch Machines with Arbitrary Capacities.” Future Generation Computer Systems 67: 22–34.
  • Koh, Shie-Gheun, Pyung-Hoi Koo, Jae-Won Ha, and Woon-Seek Lee. 2004. “Scheduling Parallel Batch Processing Machines with Arbitrary Job Sizes and Incompatible Job Families.” International Journal of Production Research 42 (19): 4091–4107.
  • Lee, Chung-Yee, Reha Uzsoy, and Louis A. Martin-Vega. 1992. “Efficient Algorithms for Scheduling Semiconductor Burn-In Operations.” Operations Research 40 (4): 764–775.
  • Leung, Joseph Y.-T., and Zhi-Long Chen. 2013. “Integrated Production and Distribution with Fixed Delivery Departure Dates.” Operations Research Letters 41 (3): 290–293.
  • Li, Kai, Zhao-hong Jia, and Joseph Y.-T. Leung. 2015. “Integrated Production and Delivery on Parallel Batching Machines.” European Journal of Operational Research 247 (3): 755–763.
  • Osman, Hany, and Kudret Demirli. 2012. “Economic Lot and Delivery Scheduling Problem for Multi-Stage Supply Chains.” International Journal of Production Economics 136 (2): 275–286.
  • Ozturk, Onur, Mehmet A. Begen, and Gregory S. Zaric. 2017. “A Branch and Bound Algorithm for Scheduling Unit Size Jobs on Parallel Batching Machines to Minimize Makespan.” International Journal of Production Research 55 (6): 1815–1831. doi:10.1080/00207543.2016.1253889.
  • Selvarajah, Esaignani, and George Steiner. 2006. “Batch Scheduling in a Two-Level Supply Chain—a Focus on the Supplier.” European Journal of Operational Research 173 (1): 226–240.
  • Stecke, Kathryn E., and Xu-Ying Zhao. 2007. “Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode.” Manufacturing & Service Operations Management 9 (2): 206–224.
  • Uzsoy, Reha. 1994. “Scheduling a Single Batch Processing Machine with Non-Identical Job Sizes.” The International Journal of Production Research 32 (7): 1615–1635.
  • Viergutz, Christian, and Sigrid Knust. 2014. “Integrated Production and Distribution Scheduling with Lifespan Constraints.” Annals of Operations Research 213 (1): 293–318.
  • Wang, Hui-Mei, and Fuh-Der Chou. 2010. “Solving the Parallel Batch-Processing Machines with Different Release Times, Job Sizes, and Capacity Limits by Metaheuristics.” Expert Systems with Applications 37 (2): 1510–1521.
  • Wang, Jun-Qiang, Guo-Qiang Fan, Ying-Qian Zhang, Cheng-Wu Zhang, and Joseph Y.-T. Leung. 2017. “Two-Agent Scheduling on a Single Parallel-Batching Machine with Equal Processing Time and Non-Identical Job Sizes.” European Journal of Operational Research 258 (2): 478–490.
  • Wang, Jun-Qiang, and Joseph Y.-T. Leung. 2014. “Scheduling Jobs with Equal-Processing-Time on Parallel Machines with Non-Identical Capacities to Minimize Makespan.” International Journal of Production Economics 156: 325–331.
  • Xu, Shu-Bin, and James C. Bean. 2007. “A Genetic Algorithm for Scheduling Parallel Non-Identical Batch Processing Machines.” In Proceedings of the IEEE Symposium on Computational Intelligence in Scheduling (SCIS'07), 143–150. Piscataway, NJ: IEEE. doi:10.1109/SCIS.2007.367682.
  • Yeung, Wing-Kwan, Tsan-Ming Choi, and T. C. E. Cheng. 2011. “Supply Chain Scheduling and Coordination with Dual Delivery Modes and Inventory Storage Cost.” International Journal of Production Economics 132 (2): 223–229.
  • Zhang, Shi-Bo-Hua, A.-Da Che, Xue-Qi Wu, and Cheng-Bin Chu. 2018. “Improved Mixed-Integer Linear Programming Model and Heuristics for Bi-Objective Single-Machine Batch Scheduling with Energy Cost Consideration.” Engineering Optimization 50 (8): 1380–1394.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.