Two dimensional guillotine cutting stock and scheduling problem in printing industry

Mostajabdaveh, Mahdi; Salman, Serdar; Tahmasbi, Nadia

doi:10.1016/j.cor.2022.106014

Cited by 6 publications

(2 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lunardi et al also proposed and evaluated a local search strategy and meta-heuristic for a flexible job shop scheduling problem with sequencing flexibility, which was proven to have competitive performance [23]. To minimise the total printing cost composed of paper and plate costs, Mostajabdaveh et al developed a nonlinear integer programming model to obtain exact solutions for small-sized instances and an efficient genetic algorithm to solve real-sized problems [24]. Tuyttens and Vandaele proposed a new greedy random adaptive search procedure to solve the label and the cover printing problem [25].…”

Section: Related Workmentioning

confidence: 99%

A Job Sequence Optimization Approach for Parallel Machine Scheduling Problem in Printing Manufacturing Systems

Li,

Zheng,

Sun

et al. 2024

IEEE Access

View full text Add to dashboard Cite

This paper investigated a parallel machine scheduling problem in the printing manufacturing systems due to operational requirements on the color-batching of the printed matter and sequential requirements on the sequence adherence of a printing press. Resequencing printing jobs as color-oriented batches reduced the costs of color changes and operational costs for printing shop. Also, post press workshop required printing shops to print jobs with minimal makespan so that high sequence adherence with its demand is assured. Based on real-world applications, we investigated two contradictory objectives-color change costs and minimal makespan-in a parallel high-fidelity printing press scheduling environment. A job sequence optimization approach is proposed. Moving interpolation algorithm and color sequence mapping algorithm are designed to reduce frequency of replacing ink. Base on iterative greedy algorithm, color sequence job groups with the same or similar color sequence are scheduled to the printing presses. Three experiments are conducted and showed that the proposed approach has good feasibility and effectiveness, and convergence in solving minimum completion time. Therefore, the proposed approach can be used in printing shops to improve scheduling efficiency and reduce production costs.INDEX TERMS Printing manufacturing systems; parallel machine scheduling problem; minimal makespan; color sequence comparison; iterated greedy algorithm

show abstract

Section: Related Workmentioning

confidence: 99%

A Job Sequence Optimization Approach for Parallel Machine Scheduling Problem in Printing Manufacturing Systems

Li,

Zheng,

Sun

et al. 2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Recently, [31] proposed a nonlinear integer programming (NIP) model and a genetic algorithm (GA) for the 2D guillotine cutting stock problem and the scheduling problem in the printing industry.…”

Section: Related Workmentioning

confidence: 99%

A review of literature: Exploring synergies between scheduling problems and cutting stock challenges in industrial optimization

Rebah,

Elloumi,

Mellouli

2024

Int. J. Finance Manage. Econ.

View full text Add to dashboard Cite

The synergy between scheduling and cutting stock optimization becomes increasingly important as industrial processes aim for increased efficiency and resource usage. This study is a general overview of the definitions, methodology, and approaches used in tackling the complications provided by the simultaneous consideration of scheduling and cutting stock problems by examining some current literature. This review intends to be a helpful resource for academics, practitioners, and decisionmakers looking to understand these manufacturing processes and simplify operations by providing light on the developing landscape of research at this combination.

show abstract

Assessing the Effectiveness and Efficiency of Selected Solution Approaches for Two-Dimensional Stock Cutting Problems (Part I): Case Study Printed Circuit Boards

Ulutas,

Ioannou,

Bracke

2024

Lecture Notes in Mechanical Engineering

View full text Add to dashboard Cite

Two dimensional guillotine cutting stock and scheduling problem in printing industry

Cited by 6 publications

References 32 publications

A Job Sequence Optimization Approach for Parallel Machine Scheduling Problem in Printing Manufacturing Systems

A Job Sequence Optimization Approach for Parallel Machine Scheduling Problem in Printing Manufacturing Systems

A review of literature: Exploring synergies between scheduling problems and cutting stock challenges in industrial optimization

Assessing the Effectiveness and Efficiency of Selected Solution Approaches for Two-Dimensional Stock Cutting Problems (Part I): Case Study Printed Circuit Boards

Contact Info

Product

Resources

About