Abstract
In this paper a problem of job sequences in a workshop is presented, taking into account non-unit demands for these and whose objective is to obtain manufacturing sequences satisfying the Quota property with a minimum total completion time for all the jobs \(\left( {C_{max} } \right)\). Two procedures are proposed to solve the problem: Mixed Integer Linear Programming and a Metaheuristic based on Multistart and Local Search. The two proposed procedures are tested using instance set Nissan-9Eng.I, in both cases giving rise to highly satisfactory performance both in quality of solutions obtained and in the CPU times required.
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
References
Pinedo, M.L.: Scheduling -Theory, Algorithms, and Systems. 5th edn. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-26580-3
Bautista, J., Alfaro, R.: Transformación de una línea de montaje de modelos mixtos en un taller de flujo regular: Caso de estudio en la factoría Nissan de Barcelona. Dirección y Organización 69, 99–110 (2019)
Bautista, J., Alfaro, R.: Mixed integer linear programming models for Flow Shop Scheduling with a Demand Plan of Job Types. CEJOR 28, 5–23 (2020)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)
Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res. 47, 65–74 (1990)
Reeves, C.R.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22, 5–13 (1995)
Aggoune, R.: Minimizing the makespan for the flow shop scheduling problem with availability constraints. Eur. J. Oper. Res. 153, 534–543 (2004)
Ronconi, D.P.: A note on constructive heuristics for the flowshop problem with blocking. Int. J. Prod. Econ. 87, 39–48 (2004)
Bautista, J., Cano, A., Companys, R., Ribas, I.: Solving the Fm|block|Cmax problem using Bounded Dynamic Programming. Eng. Appl. Artif. Intell. 25, 1235–1245 (2012)
Ozolins, A.: Improved bounded dynamic programming algorithm for solving the blocking flow shop problem. CEJOR 27, 15–38 (2019)
Monden, Y.: Toyota Production System: An Integrated Approach to Just-In-Time, 4th edn. Productivity Press, New York (2011)
Matzka, J., Di Mascolo, M., Furmans, K.: Buffer sizing of a Heijunka Kanban system. J. Intell. Manuf. 23, 40–60 (2012)
Bautista, J., Alfaro, R.: A GRASP algorithm for Quota sequences with minimum work overload and forced interruption of operations in a mixed product assembly line. Progress Artif. Intell. 7, 197–211 (2018)
Bautista, J., Alfaro, R.: An expert system to minimize operational costs in mixed-model sequencing problems with activity factor. Expert Syst. Appl. 104, 185–201 (2018)
Acknowledgments
This work has been funded by the Ministry of Economy and Competitiveness of the Government of Spain through project OPTHEUS (ref. PGC2018-095080-B-I00), including European Regional Development Funds (ERDF).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Bautista-Valhondo, J. (2021). Solving the Permutation Heijunka Flow Shop Scheduling Problem with Non-unit Demands for Jobs. In: Alba, E., et al. Advances in Artificial Intelligence. CAEPIA 2021. Lecture Notes in Computer Science(), vol 12882. Springer, Cham. https://doi.org/10.1007/978-3-030-85713-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-85713-4_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85712-7
Online ISBN: 978-3-030-85713-4
eBook Packages: Computer ScienceComputer Science (R0)