Solving the no-wait job shop scheduling problem with due date constraints: A problem transformation approach

Samarghandi, Hamed

doi:10.1016/j.cie.2019.07.054

Cited by 18 publications

(3 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this study, it is assumed that there are setup times for machines and transfer times between them. Samarghandi (12) researched a no-wait JSP focused on minimizing the makespan while factoring in job due dates. His approach involved transforming the original problem into a related one (CP) and creating models for both.…”

Section: Literature Reviewmentioning

confidence: 99%

Flexible Job Shop Scheduling Problem Considering Upper Bounds for the Amount of Interruptions Between Operations and Machines Maintenance Activities

Mahdavi,

Mohammadi,

Ahmadizar

2024

IJE

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

Flexible Job Shop Scheduling Problem Considering Upper Bounds for the Amount of Interruptions Between Operations and Machines Maintenance Activities

Mahdavi,

Mohammadi,

Ahmadizar

2024

IJE

View full text Add to dashboard Cite

“…(2018), Ying and Lin (2018), Fatih Tasgetiren et al. (2019), Samarghandi (2019b), Cheng et al. (2019), Deng et al.…”

Section: An Overview Of Shop Scheduling Problems Characteristicsmentioning

confidence: 99%

Shop scheduling in manufacturing environments: a review

Márquez

Ribeiro

2022

Int Trans Operational Res

View full text Add to dashboard Cite

We review the literature about shop scheduling problems in manufacturing systems, revealing the concepts and methodologies that most impact the usage of scheduling theory in manufacturing environments. We focus our attention on the job shop and flow shop problems and their variants. We emphasize the interactions between the scheduling functions and manufacturing paradigms such as Industry 4.0, Computer Integrated Manufacturing, Computer‐Aided Process Planning, Advanced Planning and Scheduling, and Integrated Process Planning and Scheduling. We describe the main components and characteristics of the scheduling ecosystem, and we discuss how the scheduling interacts with the components that make it up and how it is affected by them. The metadata collected from the digital libraries on which the review was based (ScienceDirect, Scopus, and Elsevier) made it possible to characterize the historical evolution of the main concepts of the scheduling ecosystem in terms of scientific publications and research trends in the period 2000–2020.

show abstract

“…Given the importance of scheduling in the design of decision support systems [4], case-specific formulations, and effective solution algorithms are of high significance to help modernize the production systems. Recent studies developed state-of-the-art solution approaches [5][6][7][8][9] to facilitate the industry-scale application of the NWSPs, which are rather complex. Many other studies extended the NWSP, for example through including setup times [10], machine maintenance [11], no-idle-time situation [12], and distributed production environment [13], among the other examples (see [14]), to address case-specific industrial needs.…”

Section: Introductionmentioning

confidence: 99%

Improved Beam Search for Optimizing No-Wait Flowshops With Release Times

et al. 2020

View full text Add to dashboard Cite

Production management of perishable goods is highly complex and requires well-informed decisions in corresponding stages. In such production environments, scheduling problems with time constraints are of high relevance to ensure the timely flow of the work-in-process material and goods. This study introduces the no-wait flowshop scheduling problem with release times (NWFSP-RT) to help advance decision support systems in the food production industry. For this purpose, an original mixed-integer linear programming (MILP) formulation is proposed for minimizing the makespan. Since Beam Search (BS) algorithm has been successfully applied to solve various scheduling problems, a BS algorithm, and an improved variant, the local search-based Beam Search (BSLS) algorithms are developed to solve the NWFSP-RT problem. Extensive numerical analysis is conducted to analyze the performance of the algorithms in solving this highly intractable extension of the scheduling problems. We showed that BSLS effectively avoids early convergence and local optimality while dismissing non-promising search directions within a partial enumeration solution approach. The statistical analysis confirmed that the improved BS algorithm performs better in terms of solution quality. Applications of the developed heuristic are worthwhile research topics to pursue in solving other complex optimization problems. INDEX TERMS Flowshop scheduling, no-wait, release time, Beam Search.

show abstract

Solving the no-wait job shop scheduling problem with due date constraints: A problem transformation approach

Cited by 18 publications

References 46 publications

Flexible Job Shop Scheduling Problem Considering Upper Bounds for the Amount of Interruptions Between Operations and Machines Maintenance Activities

Flexible Job Shop Scheduling Problem Considering Upper Bounds for the Amount of Interruptions Between Operations and Machines Maintenance Activities

Shop scheduling in manufacturing environments: a review

Improved Beam Search for Optimizing No-Wait Flowshops With Release Times

Contact Info

Product

Resources

About