Bidirectional Load Planning Procedure for Job-Shops with Availability Time-Windows for Specific Machines

Abstract:

This paper presents a bidirectional load planning procedure for job-shops with availability time-windows for specific machines. This heuristic procedure uses priority rules and reverse planning directions to progressively construct two schedules: one for machines with availability constraints (the bottlenecks) and upstream, and other for bottlenecks downstream. Bottlenecks schedule is driving the schedule for all other non-bottleneck machines. Makespan reduction for aggregate schedule is finally performed if possible, by left shifting scheduled operations to their earliest start times.

• Periodical: Applied Mechanics and Materials (Volume 760)
• Pages: 181-186
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.760.181
• Online since: May 2015
• Authors: Mădălin Gabriel Catană*, Sergiu Tonoiu, Mihail Purcărea
• Keywords: Bidirectional Scheduling, Bottleneck Scheduling, Job-Shop, Machine Availability Constraints, Machine Load Planning, Priority Rule-Based Heuristic

References

[1] K.R. Baker, D. Trietsch, Principles of Sequencing and Scheduling, John Wiley & Sons Inc., Hoboken, (2009).

[2] M. Pinedo, Scheduling: Theory, Algorithms, and Systems, 3rd Edition, Springer Science+Business Media, New York, (2008).

[3] D. Sipper, R.L. Bulfin, Production: Planning, Control, and Integration, McGraw-Hill, Singapore, (1998).

[4] T.E. Morton, D.W. Pentico, Heuristic Scheduling Systems: With Applications to Production Systems and Project Management, John Wiley & Sons Inc., Hoboken, (1993).

DOI: 10.1080/09537289608930332

[5] P. Schonsleben, Integral Logistics Management: Planning and Control of Comprehensive Supply Chains, 2nd Edition, CRC Press, Boca Raton, (2004).

[6] C.Y. Lee, Machine Scheduling with Availability Constraints, in: J.Y.T. Leung (Ed. ), Handbook of Scheduling, Chapman and Hall/CRC, Boca Raton, 2004, pp.494-506.

[7] E. Demirkol, S. Mehta, R. Uzsoy, A computational study of shifting bottleneck procedures for shop scheduling problems, Journal of Heuristics 3 (1997) 111–137.

[8] J.C. Wortmann, M.J. Euwe, M. Taal, V.C.S. Wiers, A review of capacity planning techniques within standard software packages, Production Planning & Control 7 (1996) 117-128.

DOI: 10.1080/09537289608930335

[9] C. Neagu, E. Niţu, L. Melnic, M. Catanã, Ingineria şi managementul producţiei: Bazele teoretice, Editura Didactică şi Pedagogică R.A., Bucureşti, (2006).

[10] C. Neagu, M. Catanã, M. Roşu, L. Melnic, A new view on sequencing the activities of production projects, Proceedings of the 15th International Conference on Manufacturing Systems – ICMaS 2006, Bucureşti, Editura Academiei Române, 2006, pag. 555-558.

[11] M. Catană, C. Neagu, S. Tonoiu, Scheduling of job-shop production projects with Microsoft Office Excel, Academic Journal of Manufacturing Engineering 7 (2009) 31-36.

[12] R. Kolisch, Project Scheduling under Resource Constraints - Efficient Heuristics for Several Problem Classes, Physica-Verlag, Heidelberg, (1995).

[13] R. Klein, Scheduling of Resource-Constrained Projects, Springer Science+Business Media, New York, (2000).

[14] E.L. Demeulemeester, W.S. Herroelen, Project Scheduling: A Research Handbook, Kluwer Academic Publishers, Dordrecht, (2002).

[15] C. Artigues, S. Demassey, E. Néron, Resource-Constrained Project Scheduling - Models, Algorithms, Extensions and Applications, John Wiley & Sons Inc., Hoboken, (2008).

[16] H.R. Yoosefzadeh, H.R. Tareghian, M.H. Farahi, Tri-directional scheduling scheme: theory and computation, Journal of Mathematical Modelling and Algorithms 9 (2010) 357-373.

DOI: 10.1007/s10852-010-9132-2

[17] H.R. Yoosefzadeh, H.R. Tareghian, M.H. Farahi, Multidirectional scheduling scheme in resource-constrained project scheduling problem, Naval Research Logistics 61 (2014) 44-55.

DOI: 10.1002/nav.21565