Abstract
We consider the problem of minimizing the makespan on a batch processing machine, in which jobs are not all compatible. Only compatible jobs can be included into the same batch. This relation of compatibility is represented by a split graph. Jobs have release dates. The capacity of the batch processing machine is finite or infinite. The processing time of a batch is given by the processing time of the longest job in the batch. We establish the NP-hardness of the general problem and present polynomial algorithms for several special cases. Relating scheduling theory and graph theory appears to be an interesting and important concept.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Blazewicz, J., Barcelo, J., Kubiak, W. and Rock, H.: Scheduling tasks on two processors with deadlines and additional resources, European J. Oper. Res. 26 (1986), 364–370.
Boudhar, M. and Finke, G.: Scheduling on batch processing machines with constraints of compatibility between jobs, Proc. Second IFAC/IFIP/IEEE Conf. Management and Control of Production and Logistics (MCPL'2000) 2 (Grenoble, 2000), pp. 703–708.
Boudhar, M. and Finke, G.: Scheduling on a batch machine with job compatibilities, Belgian J. Oper. Res. Statist. Comput. Sci. 40 (2000), 69–80.
Boudhar, M. and Finke, G.: Problème d'ordonnancement de tâches sur une machine à traitement par batch, Maghreb Math. Rev. (2001), to appear.
Boudhar, M.: Static scheduling on a single batch processing machine with split compatibility graphs, Cahiers Lab. Leibniz-IMA Grenoble 28 (2001).
Boudhar, M.: Scheduling on a single batch processing machine with split compatibility graphs, Submitted (2001).
Boudhar, M.: Scheduling on a single batch processing machine with bipartite compatibility graphs, Cahiers Lab. Leibniz-IMA Grenoble 45 (2002).
Brauner, N., Dhaenens-Flipo, C., Espinouse, M. L., Finke, G. and Gavranovic, H.: Decomposition into parallel work phases with application to the sheet metal industry, Proc. Internat. Conf. Industrial Engineering and Production Management (IEPM'99) 1, 1999, pp. 389–396.
Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C., Tautenhahn, T. and Van De Velde, S.: Scheduling a batching machine, J. Scheduling 1 (1998), 31–54.
Chandru, V., Lee, C. Y. and Uzsoy, R.: Minimizing total completion time on batch processing machines, Internat. J. Product. Res. 31 (1993), 2097–2121.
Dobson, G. and Nambinadom, R. S.: The batch loading and scheduling problem, Research Report, Simon School of Business Administration, University of Rochester, NY, 1992.
Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
Hochbaum, D. S. and Landy, D.: Algorithms and heuristics for scheduling semiconductor burnin operations, Research Report ESRC 94-8, University of California, Berkeley, USA, 1994.
Ikura, Y. and Gimple, M.: Efficient scheduling algorithms for a single batch processing machine, Oper. Res. Lett. 5 (1986), 61–65.
Kubiak, W. and Jolai Ghazvini, F.: Minimizing earliness/tardiness criteria on a batch processing machine with job families, Proc. Second Annual Internat. Conf. Industrial Engineering 2 (1997), 785–790.
Lee, C. Y. and Uzsoy, R.: Minimizing makespan on a single batch processing machine with dynamic job arrivals, Internat. J. Product. Res. 17 (1999), 219–236.
Lee, C. L., Uzsoy, R. and Martin-Vega, L. A.: Efficient algorithms for scheduling semiconductor burn-in operations, Oper. Res. 40 (1992), 764–775.
Li, C. L. and Lee, C. Y.: Scheduling with agreeable release and due dates on a batch processing machine, European J. Oper. Res. 96 (1997), 564–569.
Mehta, S. V. and Uzsoy, R.: Minimizing total tardiness on a batch processing machine with incompatible job families, IIE Trans. Schedul. Logistics 31 (1998), 165–178.
Potts, C. N. and Kovalyov, Y. K.: Scheduling with batching: A review, Europ. J. Oper. Res. 120 (2000), 228–249.
Tarjan, R. E.: Data Structures and Networks Algorithms, SIAM, New York, 1983.
Uzsoy, R.: Scheduling batch processing machines with incompatible job families, Internat. J. Product. Res. 33 (1995), 2685–2708.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boudhar, M. Dynamic Scheduling on a Single Batch Processing Machine with Split Compatibility Graphs. Journal of Mathematical Modelling and Algorithms 2, 17–35 (2003). https://doi.org/10.1023/A:1023669107449
Issue Date:
DOI: https://doi.org/10.1023/A:1023669107449