Abstract
This paper investigates a scheduling model with certain co-existing features of serial-batching, dynamic job arrival, multi-types of job, and setup time. In this proposed model, the jobs of all types are first partitioned into serial batches, which are then processed on a single serial-batching machine with an independent constant setup time for each new batch. In order to solve this scheduling problem, we divide it into two phases based on job arrival times, and we also derive and prove certain constructive properties for these two phases. Relying on these properties, we develop a two-phase hybrid algorithm (TPHA). In addition, a valid lower bound of the problem is also derived. This is used to validate the quality of the proposed algorithm. Computational experiments, both with small- and large-scale problems, are performed in order to evaluate the performance of TPHA. The computational results indicate that TPHA outperforms seven other heuristic algorithms. For all test problems of different job sizes, the average gap percentage between the makespan, obtained using TPHA, and the lower bound does not exceed 5.41 %.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Damodaran, P., Diyadawagamage, D.A., Ghrayeb, O., Vélez-Gallego, M.C.: A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines. Int. J. Adv. Manuf. Technol. 58(9-12), 1131–1140 (2012)
Aloulou, M.A., Bouzaiene, A., Dridi, N., Vanderpooten, D.: A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. J. Sched. 17(1), 17–29 (2014)
Ng, C.T., Cheng, T.C.E., Yuan, J.J., Liu, Z.H.: On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. Oper. Res. Lett. 31(4), 323–326 (2003)
Yuan, J.J., Yang, A.F., Cheng, T.C.E.: A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times. Eur. J. Oper. Res. 158(2), 525–528 (2004)
Shen, L., Mönch, L., Buscher, U.: An iterative approach for the serial batching problem with parallel machines and job families. Ann. Oper. Res. 206(1), 425–448 (2013)
Aloulou, M.A., Bouzaiene, A., Dridi, N., Vanderpooten, D.: A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. J. Sched. 17(1), 17–29 (2014)
Shabtay, D.: The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur. J. Oper. Res. 233(1), 64–74 (2014)
Pei, J., Liu, X., Pardalos, P.M., Fan, W., Yang, S.: Single machine serial-batching scheduling with independent setup time and deteriorating job processing times. Optimization Letters 9(1), 91–104 (2015)
Pei, J., Pardalos, P.M., Liu, X., Fan, W., Yang, S.: Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. Eur. J. Oper. Res (2014). doi:10.1016/j.ejor.2014.11.034
Chou, F.-D., Chang, P.-C., Wang, H.-M.: A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem. Int. J. Adv. Manuf. Technol. 31(3-4), 350–359 (2006)
Sahin, G., Ahuja, R.K.: Single-machine scheduling with stepwise tardiness costs and release times. J. Ind. Manag. Optim. 7(4), 825–848 (2011)
Lu, M.-S., Romanowski, R.: Multi-contextual ant colony optimization of intermediate dynamic job shop problems. Int. J. Adv. Manuf. Technol. 60(5-8), 667–681 (2012)
Lu, M.-S., Romanowski, R.: Multicontextual dispatching rules for job shops with dynamic job arrival. Int. J. Adv. Manuf. Technol. 67(1-4), 19–33 (2013)
Hosseini, N., Tavakkoli-Moghaddam, R.: Two meta-heuristics for solving a new two-machine flowshop scheduling problem with the learning effect and dynamic arrivals 65(5-8), 771–786 (2013)
Tao, J., Huang, R., Liu, T.: A 2:28-competitive algorithm for online scheduling on identical machines. J. Ind. Manag. Optim. 11(1), 185–198 (2015)
Chen, Z.L., Powell, W.B.: Exact algorithms for scheduling multiple families of jobs on parallel machines. Nav. Res. Logist. 50(7), 823–840 (2003)
Obeid, A., Dauzere-Peres, S., Yugma, C.: Scheduling job families on non-identical parallel machines with time constraints. Ann. Oper. Res. 213(1), 221–234 (2014)
Li, W., Yuan, J.: Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs. Optimization Letters 8(5), 1691–1706 (2014)
Pei, J., Liu, X., Pardalos, P.M., Fan, W., Yang, S., Wang, L.: Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain. Int. J. Adv. Manuf. Technol. 70(1-4), 335–348 (2014)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic machine scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)
Pei, J., Liu, X., Fan, W., Pardalos, P.M., Liu, L.: A novel hybrid dynamic programming algorithm for a two-stage supply chain scheduling problem. Lect. Notes Comput. Sci. 8426, 242–257 (2014)
Gottlieb, J., Raidl, G.R.: Evolutionary Computation in Combinatorial Optimization: 6th European Conference Proceedings. Springer, Berlin Heidelberg New York (2006)
Koh, S.G., Koo, P.H., Kim, D.C., Hur, W.S.: Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. Int. J. Prod. Econ. 98(1), 81–96 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pei, J., Liu, X., Fan, W. et al. Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types. Ann Math Artif Intell 76, 215–228 (2016). https://doi.org/10.1007/s10472-015-9449-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-015-9449-7