SOLVING THE LOT STREAMING AND SCHEDULING PROBLEMS: A CASE STUDY FROM THE AUTOMOTIVE INDUSTRY

Radu-Constantin VLAD

Abstract


This paper aimed to determine whether it is worth making the effort of integrating the job shop scheduling and the lot streaming problems. To answer the question a two-stage approach was used. Firstly, the number and the size of sublots were determined with a simple practice inspired heuristic. The schedule would then be developed with the help of a constraint programming model that considered challenging requests from the industry: product dependent setup times and changeovers. The objective function aimed to minimize the makespan, the number of changeovers and the number of orders not delivered on time. 30 test instances have been defined with data taken from a real large scale job shop.


Full Text:

PDF

References


Abdolrazzagh-Nezhad, M., Abdullah, S, "Job Shop Scheduling: Classification, Constraints and Objective Functions", International Journal of Computer and Information Engineering, Vol. 11(4), pp. 429–434, (2017).

Bożek, A., Werner, F., “Flexible job shop scheduling with lot streaming and sublot size optimisation”, International Journal of Production Research, ISSN 00207543, (2017).

Chen, X., Lan,Y., Benkő, A., Dósa, G., Han, X., "Optimal algorithms for online scheduling with bounded rearrangement at the end". Theoretical Computer Science, Vol. 412, No. 45, pp. 6269–6278, ISSN 0304-3975 (2011).

Garey, M.R., “The Complexity of Flowshop and Jobshop Scheduling”, Mathematics of Operations Research, 1 (2), pp. 117-129, (1976).

Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Khan, A., “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey”, Elsevier, pp. (5) 287-326, (1979).

Lageweg, B.J., Lenstra, J.K., Rinnooy Khan, A., “Job Shop Scheduling by Implicit Enumeration”, Management Science, Vol. 24, No. 4, pp. 441-450, ISSN 0025-1909, (1977).

Lenstra, J.K., Rinnooy, K., Brucker, P., “Complexity of Machine Scheduling Problems”, Annals of Discrete Mathematics, Vol. 1, pp. 343-362, ISSN 01675060, (1977).

Liu, C.H., “Lot streaming for customer order scheduling problem in job shop environments”, International Journal of Computer Integrated Manufacturing, Vol. 22, No. 9, pp. 890-907, ISSN: 0951-192X, (2009).

Rooyani, D.; Defersha, F., “A Two-Stage Multi-Objective Genetic Algorithm for a Flexible Job Shop Scheduling Problem with Lot Streaming”, Algorithms, 15, 246, ISSN: 1999-4893, (2022).

Trietsch, D., Baker, K.R., “Basic Techniques for Lot Streaming.” Operations Research, vol. 41, no. 6, pp. 1065–1076, 1993.

J.D. Ullman, “NP-complete scheduling problems”, Journal of Computer and System Sciences, Vol. 10, Issue 3, pp. 384-393, ISSN 0022-0000 (1975).

Xiong, H., Shi, S., Ren, D., Hu, J., “A survey of job shop scheduling problem: The types and models”, Computers & Operations Research, Vol. 142, ISSN 0305-0548, (2022).

Yegane, B., Y., Kamalabadi, I.,N., Khanlarzade, N., “Critical Path Method for Lot Streaming Problem in Flexible Job Shop Environment”, International Journal of Engineering, TRANSACTIONS B: Applications Vol. 30, No. 2, pp. 261-269, (2017).

Yu, Y., “A Research Review on Job Shop Scheduling Problem”, E3S Web Conf., Vol. 253, article no. 02024, (2021).

Zhang, R., Wu, C.A., “A hybrid approach to large-scale job shop scheduling”, Appl Intell, Vol. 32, pp. 47-59, (2010).


Refbacks

  • There are currently no refbacks.


JOURNAL INDEXED IN :