Advertisement

Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms

  • Baoqiang Fan
  • Guochun Tang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)

Abstract

Normal batching machine scheduling problems are assumed that the capacity of the machine, the maximum number of jobs that the machine can handle up to simultaneously, is fixed. However, in some realistic situations, the capacity of a machine is not constant. We call it a flexible batching machine. In this paper, we address the problem of scheduling jobs on a flexible batching machine to minimize the makespan. We prove that the problem is strong NP-hard, and its two agreeable cases are NP-hard. Then two pseudo-polynomial algorithms for the two cases are presented respectively.

Keywords

scheduling batching machine complexity dynamic programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahmadi, J.h., Almadi, R.h., Dasu, S., Tang, C.S.: Batching and Jobs on Batch andDiscrete Processors. Operations Research 40, 750–763 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  2. Brucker, P., Gladky, S., Hoogeveen, H., Kovalyov, M., Potts, C., Tantenhahn, T., Van de Velde, S.: Scheduling a batching machine. Journal of Scheduling 1(1), 31–54 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  3. Coffman Jr., E., Nozari, A., Yannakakis, M.: Optimal Scheduling of Products with Two Subassemblies of a Single Machine. Operations Research 37, 426–436 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  4. Garey, M.R., Johnson, D.S.: Computers and intactability: A guide to the theory of NP-completeness. Freeman, New York (1979)zbMATHGoogle Scholar
  5. Ikura, Y., Gimple, M.: Efficient scheduling algorithms for a single batch processing machine. Operations Research Letter 5, 61–65 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  6. Julien, F., Magazine, M.: Batching and Scheduling Multi-Job Orders. CORS/TIMS/ORSA Vancouver Bulletin (1989)Google Scholar
  7. Lageweg, B.J., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Computer aided complexity classification of deterministic scheduling problems. Research Report BW138/81, Mathematisch Centrum, Amsterdam (1981)Google Scholar
  8. Lee, C.-Y., Uzsoy, R.: Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research 37, 219–236 (1999)zbMATHCrossRefGoogle Scholar
  9. Lee, C.-Y., Uzsoy, R., Martin-Vega, L.A.: Efficient Algorithms for Scheduling Semiconductor Burn-in Operations. Operations Research 140(40), 764–775 (1992)CrossRefMathSciNetGoogle Scholar
  10. Liu, Z.-H., Yu, W.-C.: Scheduling one Batch Processor Subject to Job Release Dates. Discrete Applied Mathematics 105, 129–136 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  11. Santos, C., Magazine, M.: Batching in Single Operation Manufacturing Syatem. Operations Research Letter 4, 99–103 (1985)zbMATHCrossRefGoogle Scholar
  12. Tang, C.S.: Scheduling Batches on Parallel Machines with Major and Mi-nor Setups. European Journal of Operational Research 46, 28–37 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  13. Tang, G., Zhang, F., Luo, S., Liu, L.: Theory of Modern Scheduling. Shanghai Popular Science Press (2003)Google Scholar
  14. Vickson, R.G., Magazine, M.J., Santos, C.A.: Batching and Scheduling of Components at a Single Facility. Working Paper 185-MS-1989, University of Waterloo, CanadaGoogle Scholar
  15. Webster, S., Baker, K.R.: Scheduling Groups of Jobs on a Single Machine. Operations Research 43, 692–703 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  16. Zhang, G., Cai, X., Wong, C.K.: On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics 48, 241–258 (2001)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Baoqiang Fan
    • 1
  • Guochun Tang
    • 1
    • 2
  1. 1.Department of Applied MathematicsTongji UniversityShanghaiChina
  2. 2.Institute of Management EngineeringShanghai Second Polytechnic UniversityShanghaiChina

Personalised recommendations