Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems

Nascimento, Paulo Jorge; Silva, Cristóvão; Antunes, Carlos Henggeler; Moniz, Samuel

doi:10.1016/j.ejor.2024.03.004

European Journal of Operational Research

2024

DOI: 10.1016/j.ejor.2024.03.004

|View full text |Cite

Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems

Paulo Jorge Nascimento,

Cristóvão Silva,

Carlos Henggeler Antunes

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article4

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

References 52 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Enhancing the best-first-search F with incremental search and restarts for large-scale single machine scheduling with release dates and deadlines

Laalaoui,

M’Hallah

2024

Ann Oper Res

View full text Add to dashboard Cite

This paper presents a new heuristic search $$\hbox {F}_{IR}$$ F IR that determines the feasibility of scheduling a set of jobs on a single machine where each job is characterized by its release date, processing time, and deadline. $$\hbox {F}_{IR}$$ F IR uses incremental search and restart strategies to scale the best-first-search heuristic F (Laalaoui and M’Hallah, in: IEEE symposium on evolutionary scheduling and combinatorial optimisation (SSCI) 2022, IEEE, Singapore, 2022). Experimental results provide computational evidence of the superiority of $$\hbox {F}_{IR}$$ F IR for large-scale instances. In fact, $$\hbox {F}_{IR}$$ F IR outperforms the IBM ILOG CP constraint programming solver, the CPLEX mixed integer programming solver, and existing heuristics. It finds feasible solutions for many instances with 100,000 jobs in less than one minute.

show abstract

Enhancing the best-first-search F with incremental search and restarts for large-scale single machine scheduling with release dates and deadlines

Laalaoui,

M’Hallah

2024

Ann Oper Res

View full text Add to dashboard Cite

show abstract

A new branch-and-cut approach for integrated planning in additive manufacturing

Zipfel,

Tamke,

Kuttner

2024

European Journal of Operational Research

View full text Add to dashboard Cite

An effective hybrid meta-heuristic method for the simultaneous batch production and transportation problem in additive manufacturing

Wang,

Zhang,

Chu

2024

International Journal of Production Research

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems

Cited by 4 publications

References 52 publications

Enhancing the best-first-search F with incremental search and restarts for large-scale single machine scheduling with release dates and deadlines

Enhancing the best-first-search F with incremental search and restarts for large-scale single machine scheduling with release dates and deadlines

A new branch-and-cut approach for integrated planning in additive manufacturing

An effective hybrid meta-heuristic method for the simultaneous batch production and transportation problem in additive manufacturing

Contact Info

Product

Resources

About