Scheduling parallel serial-batch processing machines with incompatible job families, sequence-dependent setup times and arbitrary sizes

References

• Ahmadi, Javad H., Reza H. Ahmadi, Sriram Dasu, and Christopher S. Tang. 1992. “Batching and Scheduling Jobs on Batch and Discrete Processors.” Operations Research 40 (4): 750–763. doi:10.1287/opre.40.4.750.
   Web of Science ®Google Scholar
• Almeder, Christian, and Lars Mönch. 2011. “Metaheuristics for Scheduling Jobs with Incompatible Families on Parallel Batching Machines.” Journal of the Operational Research Society 62 (12): 2083–2096. doi:10.1057/jors.2010.186.
   Web of Science ®Google Scholar
• Avramidis, A. N., K. J. Healy, and Reha Uzsoy. 1998. “Control of a Batch-Processing Machine: A Computational Approach.” International Journal of Production Research 36 (11): 3167–3181. doi:10.1080/002075498192355.
   Web of Science ®Google Scholar
• Azizoglu, Meral, and Scott Webster. 2001. “Scheduling a Batch Processing Machine with Incompatible job Families.” Computers & Industrial Engineering 39 (3–4): 325–335. doi:10.1016/S0360-8352(01)00009-2.
   Web of Science ®Google Scholar
• Baker, Kenneth R. 2013. “Computational Results for the Flowshop Tardiness Problem.” Computers & Industrial Engineering 64 (3): 812–816. doi:10.1016/j.cie.2012.12.018.
   Web of Science ®Google Scholar
• Balasubramanian, Hari, Lars Mönch, John W. Fowler, and Michele E. Pfund. 2004. “Genetic Algorithm Based Scheduling of Parallel Batch Machines with Incompatible job Families to Minimize Total Weighted Tardiness.” International Journal of Production Research 42 (8): 1621–1638. doi:10.1080/00207540310001636994.
   Web of Science ®Google Scholar
• Bilyk, Andrew, Lars Mönch, and Christian Almeder. 2014. “Scheduling Jobs with Ready Times and Precedence Constraints on Parallel Batch Machines Using Metaheuristics.” Computers & Industrial Engineering 78: 175–185. doi:10.1016/j.cie.2014.10.008.
   Web of Science ®Google Scholar
• Brucker, Peter, Andrei Gladky, Han Hoogeveen, Mikhail Y. Kovalyov, Chris N. Potts, T. Tautenhahn, and Steef van de Velde. 1998. “Scheduling a Batching Machine.” Journal of Scheduling 1 (1): 31–54.
   Google Scholar
• Cakici, Eray, Scott J. Mason, John W. Fowler, and H. N. Geismar. 2013. “Batch Scheduling on Parallel Machines with Dynamic job Arrivals and Incompatible job Families.” International Journal of Production Research 51 (8): 2462–2477. doi:10.1080/00207543.2012.748227.
   Web of Science ®Google Scholar
• Chakhlevitch, Konstantin, Celia A. Glass, and Hans Kellerer. 2011. “Batch Machine Production with Perishability Time Windows and Limited Batch Size.” European Journal of Operational Research 210 (1): 39–47. doi:10.1016/j.ejor.2010.10.033.
   Web of Science ®Google Scholar
• Chandru, Vijaya, Chung-Yee Lee, and Reha Uzsoy. 1993. “Minimizing Total Completion Time on a Batch Processing Machine with job Families.” Operations Research Letters 13 (2): 61–65. doi:10.1016/0167-6377(93)90030-K.
   Web of Science ®Google Scholar
• Chang, P.-Y., Purushothaman Damodaran, and S. Melouk. 2004. “Minimizing Makespan on Parallel Batch Processing Machines.” International Journal of Production Research 42 (19): 4211–4220. doi:10.1080/00207540410001711863.
   Web of Science ®Google Scholar
• Cheng, Bayi, Junfeng Cai, Shanlin Yang, and Xiaoxuan Hu. 2014. “Algorithms for Scheduling Incompatible job Families on Single Batching Machine with Limited Capacity.” Computers & Industrial Engineering 75: 116–120. doi:10.1016/j.cie.2014.06.014.
   Web of Science ®Google Scholar
• Chiang, Tsung-Che, Hsueh-Chien Cheng, and Li-Chen Fu. 2010. “A Memetic Algorithm for Minimizing Total Weighted Tardiness on Parallel Batch Machines with Incompatible job Families and Dynamic job Arrival.” Computers & Operations Research 37 (12): 2257–2269. doi:10.1016/j.cor.2010.03.017.
   Web of Science ®Google Scholar
• Cicirello, Vincent A. 2009. “Weighted Tardiness Scheduling with Sequence-Dependent Setups: A Benchmark Problem for Soft Computing.” In Applications of Soft Computing. Vol. 52, edited by Erel Avineri, Mario Köppen, Keshav Dahal, Yos Sunitiyoso, and Rajkumar Roy, 189–198. Advances in Soft Computing. Berlin, Heidelberg: Springer.
   Google Scholar
• Dauzère-Pérès, Stéphane, and Lars Mönch. 2013. “Scheduling Jobs on a Single Batch Processing Machine with Incompatible job Families and Weighted Number of Tardy Jobs Objective.” Computers & Operations Research 40 (5): 1224–1233. doi:10.1016/j.cor.2012.12.012.
   Web of Science ®Google Scholar
• Dobson, Gregory, and Ramakrishnan S. Nambimadom. 2001. “The Batch Loading and Scheduling Problem.” Operations Research 49 (1): 52–65. doi:10.1287/opre.49.1.52.11189.
   Web of Science ®Google Scholar
• Duenyas, Izak, and John J. Neale. 1997. “Stochastic Scheduling of a Batch Processing Machine with Incompatible job Families.” Annals of Operations Research 70: 191–220. doi:10.1023/A:1018922104670.
   Web of Science ®Google Scholar
• Dupont, Lionel, and Clarisse Dhaenens-Flipo. 2002. “Minimizing the Makespan on a Batch Machine with non-Identical job Sizes: An Exact Procedure.” Computers & Operations Research 29 (7): 807–819. doi:10.1016/S0305-0548(00)00078-2.
   Web of Science ®Google Scholar
• Ðurasević, Marko, and Domagoj Jakobović. 2018. “A Survey of Dispatching Rules for the Dynamic Unrelated Machines Environment.” Expert Systems with Applications 113: 555–569. doi:10.1016/j.eswa.2018.06.053.
   Web of Science ®Google Scholar
• Emde, Simon, Lukas Polten, and Michel Gendreau. 2020. “Logic-based Benders Decomposition for Scheduling a Batching Machine.” Computers & Operations Research 113: 104777. doi:10.1016/j.cor.2019.104777.
   Web of Science ®Google Scholar
• Erramilli, Vishnu, and Scott J. Mason. 2008. “Multiple Orders per job Batch Scheduling with Incompatible Jobs.” Annals of Operations Research 159 (1): 245–260. doi:10.1007/s10479-007-0286-x.
   Web of Science ®Google Scholar
• Fanti, M. P., B. Maione, G. Piscitelli, and B. Turchiano. 1996. “Heuristic Scheduling of Jobs on a Multi-Product Batch Processing Machine.” International Journal of Production Research 34 (8): 2163–2186. doi:10.1080/00207549608905019.
   Web of Science ®Google Scholar
• Fowler, John W., Nipa Phojanamongkolkij, J. K. Cochran, and D. C. Montgomery. 2002. “Optimal Batching in a Wafer Fabrication Facility Using a Multiproduct G/G/c Model with Batch Processing.” International Journal of Production Research 40 (2): 275–292. doi:10.1080/00207540110081489.
   Web of Science ®Google Scholar
• Fu, Qing, Appa I. Sivakumar, and Kunpeng Li. 2012. “Optimisation of Flow-Shop Scheduling with Batch Processor and Limited Buffer.” International Journal of Production Research 50 (8): 2267–2285. doi:10.1080/00207543.2011.565813.
   Web of Science ®Google Scholar
• Gahm, Christian. 2021. “Problem Instances for the Parallel Serial-Batch Scheduling Problem with Incompatible job Families, Sequence-Dependent Setup Times, and Arbitrary Sizes.” Mendeley Data V1.
   Google Scholar
• Gahm, Christian, John J. Kanet, and Axel Tuma. 2019. “On the Flexibility of a Decision Theory-Based Heuristic for Single Machine Scheduling.” Computers & Operations Research 101: 103–115. doi:10.1016/j.cor.2018.09.005.
   Web of Science ®Google Scholar
• Gao, Yuan, Jinjiang Yuan, C. T. Ng, and Edwin T. C. Cheng. 2019. “A Further Study on two-Agent Parallel-Batch Scheduling with Release Dates and Deteriorating Jobs to Minimize the Makespan.” European Journal of Operational Research 273 (1): 74–81. doi:10.1016/j.ejor.2018.07.040.
   Web of Science ®Google Scholar
• Gardan, Julien. 2016. “Additive Manufacturing Technologies: State of the art and Trends.” International Journal of Production Research 54 (10): 3118–3132. doi:10.1080/00207543.2015.1115909.
   Web of Science ®Google Scholar
• Geiger, Christopher D., and Reha Uzsoy. 2008. “Learning Effective Dispatching Rules for Batch Processor Scheduling.” International Journal of Production Research 46 (6): 1431–1454. doi:10.1080/00207540600993360.
   Web of Science ®Google Scholar
• Gokhale, Ravindra, and M. Mathirajan. 2011. “Heuristic Algorithms for Scheduling of a Batch Processor in Automobile Gear Manufacturing.” International Journal of Production Research 49 (10): 2705–2728. doi:10.1080/00207541003720368.
   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.” In Discrete Optimization II, edited by Bernhard H. Korte, Ellis L. Johnson, and P. L. Hammer, 287–326. Annals of Discrete Mathematics 5. Amsterdam: North-Holland Pub. Co.
   Google Scholar
• Gupta, A. K., and A. I. Sivakumar. 2006. “Optimization of due-Date Objectives in Scheduling Semiconductor Batch Manufacturing.” International Journal of Machine Tools and Manufacture 46 (12–13): 1671–1679. doi:10.1016/j.ijmachtools.2005.08.017.
   Web of Science ®Google Scholar
• He, Cheng, Chunqi Xu, and Hao Lin. 2020. “Serial-batching Scheduling with two Agents to Minimize Makespan and Maximum Cost.” Journal of Scheduling 23: 609–617.
   Web of Science ®Google Scholar
• Helo, Petri, Duy Phuong, and Yuqiuge Hao. 2019. “Cloud Manufacturing – Scheduling as a Service for Sheet Metal Manufacturing.” Computers & Operations Research 110: 208–219. doi:10.1016/j.cor.2018.06.002.
   Web of Science ®Google Scholar
• Huang, Zewen, Zhongshun Shi, and Leyuan Shi. 2019. “Minimising Total Weighted Completion Time on Batch and Unary Machines with Incompatible job Families.” International Journal of Production Research 57 (2): 567–581. doi:10.1080/00207543.2018.1470341.
   Web of Science ®Google Scholar
• Huang, Jingying, Liya Wang, and Zhibin Jiang. 2020. “A Method Combining Rules with Genetic Algorithm for Minimizing Makespan on a Batch Processing Machine with Preventive Maintenance.” International Journal of Production Research 58 (13): 4086–4102. doi:10.1080/00207543.2019.1641643.
   Web of Science ®Google Scholar
• Hung, Yi-Feng. 1998. “Scheduling of Mask Shop E-Beam Writers.” IEEE Transactions on Semiconductor Manufacturing 11 (1): 165–172. doi:10.1109/66.661296.
   Web of Science ®Google Scholar
• Huynh, Nhat-To, and Chen-Fu Chien. 2018. “A Hybrid Multi-Subpopulation Genetic Algorithm for Textile Batch Dyeing Scheduling and an Empirical Study.” Computers & Industrial Engineering 125: 615–627. doi:10.1016/j.cie.2018.01.005.
   Web of Science ®Google Scholar
• Jia, Wenyou, Zhibin Jiang, and You Li. 2013. “Closed Loop Control-Based Real-Time Dispatching Heuristic on Parallel Batch Machines with Incompatible job Families and Dynamic Arrivals.” International Journal of Production Research 51 (15): 4570–4584. doi:10.1080/00207543.2013.774505.
   Web of Science ®Google Scholar
• Jia, Wenyou, Zhibin Jiang, and You Li. 2015. “Combined Scheduling Algorithm for re-Entrant Batch-Processing Machines in Semiconductor Wafer Manufacturing.” International Journal of Production Research 53 (6): 1866–1879. doi:10.1080/00207543.2014.965355.
   Web of Science ®Google Scholar
• Jolai, Fariborz. 2005. “Minimizing Number of Tardy Jobs on a Batch Processing Machine with Incompatible job Families.” European Journal of Operational Research 162 (1): 184–190. doi:10.1016/j.ejor.2003.10.011.
   Web of Science ®Google Scholar
• Jula, Payman, and Robert C. Leachman. 2010. “Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints.” Operations Research 58 (4-part-1): 933–947. doi:10.1287/opre.1090.0788.
   Web of Science ®Google Scholar
• Kashan, A. H., and B. Karimi. 2008. “Scheduling a Single Batch-Processing Machine with Arbitrary job Sizes and Incompatible job Families: An ant Colony Framework.” Journal of the Operational Research Society 59 (9): 1269–1280. doi:10.1057/palgrave.jors.2602448.
   Web of Science ®Google Scholar
• Kempf, Karl G., Reha Uzsoy, and Cheng-Shuo Wang. 1998. “Scheduling a Single Batch Processing Machine with Secondary Resource Constraints.” Journal of Manufacturing Systems 17 (1): 37–51. doi:10.1016/S0278-6125(98)80008-3.
   Web of Science ®Google Scholar
• 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. doi:10.1080/00207540410001704041.
   Web of Science ®Google Scholar
• Koh, Shie-Gheun, Pyung-Hoi Koo, Dong-Chun Kim, and Won-Suk Hur. 2005. “Scheduling a Single Batch Processing Machine with Arbitrary job Sizes and Incompatible job Families.” International Journal of Production Economics 98 (1): 81–96. doi:10.1016/j.ijpe.2004.10.001.
   Web of Science ®Google Scholar
• Kovalyov, Mikhail Y., and Dmitrij Šešok. 2019. “Two-agent Scheduling with Deteriorating Jobs on a Single Parallel-Batching Machine: Refining Computational Complexity.” Journal of Scheduling 22 (5): 603–606. doi:10.1007/s10951-019-00613-x.
   Web of Science ®Google Scholar
• Kurz, Mary E. 2003. “On the Structure of Optimal Schedules for Minimizing Total Weighted Tardiness on Parallel, Batch-Processing Machines.” In Proceedings of the 10th Industrial Engineering Research Conference. May 17–21. Portland, Oregon.
   Google Scholar
• Kurz, Mary E., and Scott J. Mason. 2008. “Minimizing Total Weighted Tardiness on a Batch-Processing Machine with Incompatible job Families and job Ready Times.” International Journal of Production Research 46 (1): 131–151. doi:10.1080/00207540600786665.
   Web of Science ®Google Scholar
• Lawler, Eugene L. 1977. “Annals of Discrete Mathematics.” Studies in Integer Programming 1: 331–342. Annals of Discrete Mathematics: Elsevier.
   Google Scholar
• Lee, Young-Hoon, and Michael L. Pinedo. 1997. “Scheduling Jobs on Parallel Machines with Sequence-Dependent Setup Times.” European Journal of Operational Research 100 (3): 464–474. doi:10.1016/S0377-2217(95)00376-2.
   Web of Science ®Google Scholar
• Lei, Deming, and Xiu P. Guo. 2011. “Variable Neighbourhood Search for Minimising Tardiness Objectives on Flow Shop with Batch Processing Machines.” International Journal of Production Research 49 (2): 519–529. doi:10.1080/00207540903536130.
   Web of Science ®Google Scholar
• Li, Shuguang. 2017. “Approximation Algorithms for Scheduling Jobs with Release Times and Arbitrary Sizes on Batch Machines with non-Identical Capacities.” European Journal of Operational Research 263 (3): 815–826. doi:10.1016/j.ejor.2017.06.021.
   Web of Science ®Google Scholar
• Li, Shi-Sheng, and Ren-Xia Chen. 2014. “Single-machine Parallel-Batching Scheduling with Family Jobs to Minimize Weighted Number of Tardy Jobs.” Computers & Industrial Engineering 73: 5–10. doi:10.1016/j.cie.2014.04.007.
   Web of Science ®Google Scholar
• Li, XiaoLin, YuPeng Li, and YanLi Huang. 2019. “Heuristics and Lower Bound for Minimizing Maximum Lateness on a Batch Processing Machine with Incompatible job Families.” Computers & Operations Research 106: 91–101. doi:10.1016/j.cor.2019.02.012.
   Web of Science ®Google Scholar
• Lin, Rock, and Ching-Jong Liao. 2012. “A Case Study of Batch Scheduling for an Assembly Shop.” International Journal of Production Economics 139 (2): 473–483. doi:10.1016/j.ijpe.2012.05.002.
   Web of Science ®Google Scholar
• Liu, J. J., Z. T. Li, Q. X. Chen, and N. Mao. 2016. “Controlling Delivery and Energy Performance of Parallel Batch Processors in Dynamic Mould Manufacturing.” Computers & Operations Research 66: 116–129. doi:10.1016/j.cor.2015.08.006.
   Web of Science ®Google Scholar
• Maecker, Söhnke, and Liji Shen. 2020. “Solving Parallel Machine Problems with Delivery Times and Tardiness Objectives.” Annals of Operations Research 285 (1–2): 315–334. doi:10.1007/s10479-019-03267-2.
   Web of Science ®Google Scholar
• Malve, Sujay, and Reha Uzsoy. 2007. “A Genetic Algorithm for Minimizing Maximum Lateness on Parallel Identical Batch Processing Machines with Dynamic job Arrivals and Incompatible job Families.” Computers & Operations Research 34 (10): 3016–3028. doi:10.1016/j.cor.2005.11.011.
   Web of Science ®Google Scholar
• Mason, Scott J., John 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. doi:10.1002/jos.102.
   Web of Science ®Google Scholar
• Mathirajan, M., A. I. Sivakumar, and Vijaya Chandru. 2004. “Scheduling Algorithms for Heterogeneous Batch Processors with Incompatible job-Families.” Journal of Intelligent Manufacturing 15 (6): 787–803. doi:10.1023/B:JIMS.0000042664.94495.26.
   Web of Science ®Google Scholar
• Mehta, Sanjay V., and Reha Uzsoy. 1998. “Minimizing Total Tardiness on a Batch Processing Machine with Incompatible job Families.” IIE Transactions 30 (2): 165–178.
   Web of Science ®Google Scholar
• Mönch, Lars, Hari Balasubramanian, John W. Fowler, and Michele 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. doi:10.1016/j.cor.2004.04.001.
   Web of Science ®Google Scholar
• Mönch, Lars, Jens Zimmermann, and Peter Otto. 2006. “Machine Learning Techniques for Scheduling Jobs with Incompatible Families and Unequal Ready Times on Parallel Batch Machines.” Engineering Applications of Artificial Intelligence 19 (3): 235–245. doi:10.1016/j.engappai.2005.10.001.
   Web of Science ®Google Scholar
• Mundim, Leandro R., Marina Andretta, Maria A. Carravilla, and José F. Oliveira. 2018. “A General Heuristic for two-Dimensional Nesting Problems with Limited-Size Containers.” International Journal of Production Research 56 (1–2): 709–732. doi:10.1080/00207543.2017.1394598.
   Web of Science ®Google Scholar
• Nong, Q. Q., C. T. Ng, and Edwin T. C. Cheng. 2008. “The Bounded Single-Machine Parallel-Batching Scheduling Problem with Family Jobs and Release Dates to Minimize Makespan.” Operations Research Letters 36 (1): 61–66. doi:10.1016/j.orl.2007.01.007.
   Web of Science ®Google Scholar
• Nong, Qingqin, Jinjiang Yuan, Ruyan Fu, Lin Lin, and Ji Tian. 2008. “The Single-Machine Parallel-Batching on-Line Scheduling Problem with Family Jobs to Minimize Makespan.” International Journal of Production Economics 111 (2): 435–440. doi:10.1016/j.ijpe.2006.12.061.
   Web of Science ®Google Scholar
• Oey, Kasin, and Scott J. Mason. 2001. “Scheduling batch processing machines in complex job shops.” In Proceeding of the 2001 Winter Simulation Conference, edited by Brett A. Peters, Jeffrey S. Smith, D. J. Medeiros, and Matt D. Rohrer, 1200–1207: IEEE. December 9–12. Arlington, VA, USA.
   Google Scholar
• Park, Youngshin, Sooyoung Kim, and Young-Hoon Lee. 2000. “Scheduling Jobs on Parallel Machines Applying Neural Network and Heuristic Rules.” Computers & Industrial Engineering 38 (1): 189–202. doi:10.1016/S0360-8352(00)00038-3.
   Web of Science ®Google Scholar
• Passchyn, Ward, and Frits C. R. Spieksma. 2019. “Scheduling Parallel Batching Machines in a Sequence.” Journal of Scheduling 22 (3): 335–357. doi:10.1007/s10951-018-0560-6.
   Web of Science ®Google Scholar
• Pearn, W. L., J. S. Hong, and Y. T. Tai. 2013. “The Burn-in Test Scheduling Problem with Batch Dependent Processing Time and Sequence Dependent Setup Time.” International Journal of Production Research 51 (6): 1694–1706. doi:10.1080/00207543.2012.694488.
   Web of Science ®Google Scholar
• Perez, Imelda C., John W. Fowler, and W. Matthew Carlyle. 2005. “Minimizing Total Weighted Tardiness on a Single Batch Process Machine with Incompatible job Families.” Computers & Operations Research 32 (2): 327–341. doi:10.1016/S0305-0548(03)00239-9.
   Web of Science ®Google Scholar
• Potts, Chris N., and Mikhail Y. Kovalyov. 2000. “Scheduling with Batching: A Review.” European Journal of Operational Research 120 (2): 228–249. doi:10.1016/S0377-2217(99)00153-8.
   Web of Science ®Google Scholar
• Rocha, Pedro L., Martín G. Ravetti, Geraldo R. Mateus, and Panos M. Pardalos. 2008. “Exact Algorithms for a Scheduling Problem with Unrelated Parallel Machines and Sequence and Machine-Dependent Setup Times.” Computers & Operations Research 35 (4): 1250–1264. doi:10.1016/j.cor.2006.07.015.
   Web of Science ®Google Scholar
• Shen, Liji, and Udo Buscher. 2012. “Solving the Serial Batching Problem in job Shop Manufacturing Systems.” European Journal of Operational Research 221 (1): 14–26. doi:10.1016/j.ejor.2012.03.001.
   Web of Science ®Google Scholar
• Shen, Liji, Jatinder N. D. Gupta, and Udo Buscher. 2014. “Flow Shop Batching and Scheduling with Sequence-Dependent Setup Times.” Journal of Scheduling 17 (4): 353–370. doi:10.1007/s10951-014-0369-x.
   Web of Science ®Google Scholar
• Shi, Zhongshun, Zewen Huang, and Leyuan Shi. 2018. “Customer Order Scheduling on Batch Processing Machines with Incompatible job Families.” International Journal of Production Research 56 (1–2): 795–808. doi:10.1080/00207543.2017.1401247.
   Web of Science ®Google Scholar
• Suppiah, Yasothei, and Mohamed K. Omar. 2014. “A Hybrid Tabu Search for Batching and Sequencing Decisions in a Single Machine Environment.” Computers & Industrial Engineering 78: 135–147. doi:10.1016/j.cie.2014.10.010.
   Web of Science ®Google Scholar
• Tajan, John B. C., Appa I. Sivakumar, and Stanley B. Gershwin. 2012. “Heuristic Control of Multiple Batch Processors with Incompatible job Families and Future job Arrivals.” International Journal of Production Research 50 (15): 4206–4219. doi:10.1080/00207543.2011.601342.
   Web of Science ®Google Scholar
• Tang, Lixin, Xiaoli Zhao, Jiyin Liu, and Joseph Y. Leung. 2017. “Competitive two-Agent Scheduling with Deteriorating Jobs on a Single Parallel-Batching Machine.” European Journal of Operational Research 263 (2): 401–411. doi:10.1016/j.ejor.2017.05.019.
   Web of Science ®Google Scholar
• Tangudu, S. K., and Mary E. Kurz. 2006. “A Branch and Bound Algorithm to Minimise Total Weighted Tardiness on a Single Batch Processing Machine with Ready Times and Incompatible job Families.” Production Planning & Control 17 (7): 728–741. doi:10.1080/09537280600901467.
   Web of Science ®Google Scholar
• Uzsoy, Reha. 1995. “Scheduling Batch Processing Machines with Incompatible job Families.” International Journal of Production Research 33 (10): 2685–2708. doi:10.1080/00207549508904839.
   Web of Science ®Google Scholar
• Valente, Jorge M., and Jeffrey E. Schaller. 2012. “Dispatching Heuristics for the Single Machine Weighted Quadratic Tardiness Scheduling Problem.” Computers & Operations Research 39 (9): 2223–2231. doi:10.1016/j.cor.2011.11.005.
   Web of Science ®Google Scholar
• Vepsalainen, Ari P. J., and Thomas E. Morton. 1987. “Priority Rules for Job Shops with Weighted Tardiness Costs.” Management Science 33 (8): 1035–1047. doi:10.1287/mnsc.33.8.1035.
   Web of Science ®Google Scholar
• Wang, Shasha, Mary E. Kurz, Scott J. Mason, and Eghbal Rashidi. 2019. “Two-stage Hybrid Flow Shop Batching and lot Streaming with Variable Sublots and Sequence-Dependent Setups.” International Journal of Production Research 57 (22): 6893–6907. doi:10.1080/00207543.2019.1571251.
   Web of Science ®Google Scholar
• Yao, Shiqing, Zhibin Jiang, and Na Li. 2012. “A Branch and Bound Algorithm for Minimizing Total Completion Time on a Single Batch Machine with Incompatible job Families and Dynamic Arrivals.” Computers & Operations Research 39 (5): 939–951. doi:10.1016/j.cor.2011.06.003.
   Web of Science ®Google Scholar
• Zhang, Cheng, Zhongshun Shi, Zewen Huang, Yifan Wu, and Leyuan Shi. 2017. “Flow Shop Scheduling with a Batch Processor and Limited Buffer.” International Journal of Production Research 55 (11): 3217–3233. doi:10.1080/00207543.2016.1268730.
   Web of Science ®Google Scholar