Abstract
Job shop scheduling is among the most well studied problems in production planning. Yet, there is still a lack of comprehensive treatment of intermediate buffers. This paper deals with limited intermediate buffers with the important extension that not all jobs need to be handled in the same way regarding buffer space consumption. A heuristic to find feasible solutions is described and computational results are presented. While a reference procedure from literature devoted to case of unit buffer space consumption does not guarantee feasibility in all cases, the approach developed in this paper does. Moreover, it allows for variable space consumption, a feature which is new to literature paying better attention to more practical requirements than other models.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Muth, J.F., Thompson, G.L.: Industrial Scheduling. Prentice Hall, Englewood Cliffs (1963)
Carlier, J., Pinson, E.: An algorithm for solving the job-shop problem. Management Science 35, 164–176 (1989)
Pinson, E.: The job shop scheduling problem: A concise survey and some recent developments. In: Chretienne, P., Coffman, E.G., Lenstra, J.K., Liu, Z. (eds.) Scheduling Theory and Its Applications, pp. 277–294. Wiley, New York (1997)
Blazewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: conventional and new solution techniques. European Journal of Operational Research 93, 1–33 (1996)
Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: past, present and future. European Journal of Operational Research 113, 390–434 (1999)
Brinkkötter, W., Brucker, P.: Solving open benchmark instances for the job shop problem by parallel head-tail adjustments. Journal of Scheduling 4, 53–64 (2001)
Nowicki, E., Smutnicki, C.: An advanced tabu search algorithm for the job-shop problem. Journal of Scheduling 8, 145–159 (2005)
Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science 34, 391–401 (1988)
Applegate, D., Cook, W.: A computational study of the job shop scheduling problem. ORSA Journal on Computing 3, 149–156 (1991)
Leisten, R.: Flowshop sequencing problems with limited buffer storage. International Journal of Production Research 28, 2085–2100 (1990)
Witt, A., Voß, S.: Simple heuristics for scheduling with limited intermediate storage. Computers & Operations Research 34, 2293–2309 (2007)
Mascis, A., Pacciarelli, D.: Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 143, 498–517 (2002)
Brucker, P., Heitmann, S., Hurink, J., Nieberg, T.: Job-shop scheduling with limited capacity buffers. OR Spectrum 25, 151–176 (2006)
Heitmann, S.: Job-shop scheduling with limited buffer capacities. VDM Dr. Müller, Saarbrücken (2007)
Fahmy, S.A., ElMekkawy, T.Y., Balakrishnan, S.: Deadlock-free scheduling of flexible job shops with limited capacity buffers. European Journal of Industrial Engineering 2, 231–252 (2008)
Lawley, M., Reveliotis, S., Ferreira, P.: Structural control of flexible manufacturing systems and the neighborhood policy: Parts 1 & 2. IIE Transactions 29, 877–899 (1997)
Habermann, A.: Prevention of system deadlocks. Communications of the ACM 12, 373–377 (1969)
Lawley, M., Mittenthal, J.: Order release and deadlock avoidance interactions in counter-flow system optimization. International Journal of Production Research 37, 3043–3062 (1999)
Aytug, H., Barua, A., Lawley, M., Uzsoy, R.: Observations on the interactions among deadlock avoidance policies and dispatching rules in automated manufacturing systems. International Journal of Production Research 41, 81–95 (2003)
Xing, K., Hu, B., Chen, H.: Deadlock avoidance policy for Petri net modeling of flexible manufacturing systems with shared resources. IEEE Transactions on Automatic Control 41, 289–295 (1996)
Zandong, H., Lee, G.: Application of Petri nets for deadlock analysis and avoidance in flexible manufacturing systems. International Journal of Advanced Manufacturing Technology 25, 735–742 (2005)
Kim, Y.W., Suzuki, T., Narikiyo, T.: FMS scheduling based on timed Petri Net model and reactive graph search. Applied Mathematical Modelling 31, 955–970 (2007)
Hatzack, W., Nebel, B.: The Operational Traffic Control Problem: Computational Complexity and Solutions. In: Cesta, A., Borrajo, D. (eds.) Recent Advances in AI Planning, 6th European Conference on Planning (ECP 2001), pp. 49–60. Springer, Berlin (2001)
Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 225–251. Prentice Hall, Englewood Cliffs (1963)
Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Graduate School of Industrial Administration. Carnegie-Mellon University, Pittsburgh (1984)
Storer, R.H., Wu, S.D., Vaccari, R.: New search spaces for sequencing instances with application to job shop scheduling. Management Science 38, 1495–1509 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witt, A., Voß, S. (2010). Job Shop Scheduling with Buffer Constraints and Jobs Consuming Variable Buffer Space. In: Dangelmaier, W., Blecken, A., Delius, R., Klöpfer, S. (eds) Advanced Manufacturing and Sustainable Logistics. IHNS 2010. Lecture Notes in Business Information Processing, vol 46. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12494-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-12494-5_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12461-7
Online ISBN: 978-3-642-12494-5
eBook Packages: Computer ScienceComputer Science (R0)