Parallel machine scheduling with tool loading: a constraint programming approach

Gökgür, Burak; Hnich, Brahim; Özpeynirci, Selin

doi:10.1080/00207543.2017.1421781

Cited by 41 publications

(11 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the literature of tool management and operation scheduling, there are several studies on constraint programming approach for solving problems, such as scheduling of flexible manufacturing systems with machine and tool limitations (Zeballos [24], Zeballos et al [25]), scheduling with machine eligibility constraints (Edis and Ozkarahan [26]), integrated view of scheduling problems in a flexible manufacturing setting (Novas and Henning [27]), and parallel machine scheduling with tool loading (Gökgür et al [28]).…”

Section: Constraint Programming Approachmentioning

confidence: 99%

Minimization of Number of Tool Switching Instants in Automated Manufacturing Systems

Gökgür

Özpeynirci

2022

Gazi University Journal of Science

View full text Add to dashboard Cite

show abstract

Section: Constraint Programming Approachmentioning

confidence: 99%

Minimization of Number of Tool Switching Instants in Automated Manufacturing Systems

Gökgür

Özpeynirci

2022

Gazi University Journal of Science

View full text Add to dashboard Cite

show abstract

“…model, heuristic MILP/TS Beezão et al (2017) math. model, heuristic ILP/ALNS Gökgür, Hnich, and Özpeynirci (2018) heuristic constraint programming higher. Beezão et al (2017) present two ILPs for the tool switching problem with parallel machines and specified processing times.…”

Section: Referencesmentioning

confidence: 99%

“…They solve small problems with up to 15 jobs, 10 tools, and 3 machines to optimality. Özpeynirci, Gökgür, and Hnich (2016) and Gökgür, Hnich, and Özpeynirci (2018) investigate the SSP for unrelated parallel machines to minimise the makespan without considering capacity constraints or tool switching time but including a limited amount of tool copies. Özpeynirci, Gökgür, and Hnich (2016) present two MILP models as well as a tabu search heuristic due to the weak performance of the mathematical models for this NP-hard problem.…”

Section: Referencesmentioning

confidence: 99%

See 1 more Smart Citation

The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends

Calmels

2018

International Journal of Production Research

View full text Add to dashboard Cite

The job sequencing and tool switching problem is a combinatorial optimisation problem that appears in various industries, mainly in the manufacturing sector. Although tool switching is only part of a much larger decision-making process in manufacturing systems, it has a major impact on the overall performance of the system by affecting the total set-up time as well as the machine and tool utilisation. Over the past few decades, various approaches have been applied to tool switching problems. This study provides a comprehensive review of the literature on the job sequencing and tool switching problem. Studies are identified and compared through a structured literature review and classified according to a new framework which allows the identification of problem perspectives and solution methods. The results show that current research does not fully exploit real-world situations and studies are often limited to a single-machine and uniform tool size and set-up time. Finally, this literature review summarises the current research results and provides directions for future research.. comparatively review, in an organised fashion, the existing unclassified tool switching literature with respect to problem formulation development and applied solution methods, . develop a classification scheme that may help to identify aspects of the tool switching problem that have been insufficiently explored and show how far the existing modelling efforts have progressed towards real-world needs, . synthesise the past trends of tool switching studies, and . offer some suggestions and directions for future research.The remainder of this paper is structured as follows. Section 2 introduces the generic tool switching problem, its subproblems, and related optimisation problems. Subsequently, the research approach is described in section 3, and the classification framework is described in section 4. The literature review is presented in section 5. Section 6 outlines the research gaps and implications for future research. Section 7 concludes the paper with a short summary.

show abstract

“…This requires a much more flexible algorithm capable of generating all B & B combinations which then need to be checked against the defined project boundaries for their validity. Another highly important difference of the APOLLO project to typical B & B is that it is not a classic n-job scheduling scenario of either the identical parallel (Nessah, Yalaoui, and Chu 2008;Ranjbar, Davari, and Leus 2012;Gökgür, Hnich, and Özpeynirci 2018) or different sequential machines type (Brucker, Jurisch, and Sievers 1994;Mingozzi et al 1998;Brucker, Hilbig, and Hurink 1999;Detienne, Sadykov, and Tanaka 2016).…”

Section: Branch and Bound Concept Of Apollomentioning

confidence: 99%

Production planning optimisation for composite aerospace manufacturing

Hueber

Fischer

Schwingshandl

et al. 2018

International Journal of Production Research

View full text Add to dashboard Cite

Composite materials proved highly successful for aerospace applications in the last decades, but increased cost pressure forces the composite industry to become more efficient. This requires new manufacturing technologies and optimised processes as raw material costs and labour costs are basically fixed when wanting to keep production on site. Probably the most defining process for aerospace composite production is manual layup of prepreg material with subsequent curing in an autoclave. From production planning view, this combination poses the challenge of transition from discrete layup manufacturing to batch curing processing with the restriction of limited allowed storage time of the prepreg material prior to cure. In this paper, a new approach for production order optimisation at the conjunction of discrete and batch processing is presented. The APOLLO named tool is designed to decrease throughput times, streamline production and increase autoclave utilisation in the composite aerospace industry.

show abstract

Parallel machine scheduling with tool loading: a constraint programming approach

Cited by 41 publications

References 43 publications

Minimization of Number of Tool Switching Instants in Automated Manufacturing Systems

Minimization of Number of Tool Switching Instants in Automated Manufacturing Systems

The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends

Production planning optimisation for composite aerospace manufacturing

Contact Info

Product

Resources

About