Optimal job insertion in the no-wait job shop

Bürgy, Reinhard; Gröflin, Heinz

doi:10.1007/s10878-012-9466-y

Cited by 16 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sachchida et al (2018) developed an evolutionary algorithm with guided mutation (EA/G) based hyper-heuristic which employs an evolutionary algorithm to explore the search space and a generic guided mutation, multi-insert points and multi-swap. Bürgy & Gröflin (2012) proposed a highly efficient algorithm based on a compact formulation of the NWJS problem and a characterization of all feasible insertions as the stable sets in a derived comparability graph. Sundar et al (2017) used a hybrid artificial bee colony (ABC) algorithm with determination of a neighbouring solution with the local search.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach

BOUGLOULA

2023

Management and Production Engineering Review

View full text Add to dashboard Cite

This work is interested to optimize the job shop scheduling problem with a no wait constraint. This constraint occurs when two consecutive operations in a job must be processed without any waiting time either on or between machines. The no wait job shop scheduling problem is a combinatorial optimization problem. Therefore, the study presented here is focused on solving this problem by proposing strategy for making Jaya algorithm applicable for handling optimization of this type of problems and to find processing sequence that minimizes the makespan (Cmax). Several benchmarks are used to analyze the performance of this algorithm compared to the best-known solutions.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach

BOUGLOULA

2023

Management and Production Engineering Review

View full text Add to dashboard Cite

show abstract

“…They showed that the job insertion problem is N P -hard in the classical job shop environment; however, it is polynomially solvable in the job shop coupled task setting. Bürgy and Gröflin (2013) studied a similar job insertion problem, where sequence-dependent setup times between consecutive tasks on a machine are present. They proposed an O(n 2 max{n, m})-time algorithm to solve the problem.…”

Section: The Job Shop Problemmentioning

confidence: 99%

Coupled task scheduling with exact delays: Literature review and models

Khatami

Salehipour

Cheng

2020

European Journal of Operational Research

View full text Add to dashboard Cite

The coupled task scheduling problem concerns scheduling a set of jobs, each with at least two tasks and there is an exact delay period between two consecutive tasks, on a set of machines to optimize a performance criterion. While research on the problem dates back to the 1980s, interests in the computational complexity of variants of the problem and solution methodologies have been evolving in the past few years. This motivates us to present an up-to-date and comprehensive literature review on the topic. Aiming to provide a complete road map for future research on the coupled task scheduling problem, we discuss all the relevant studies and potential research opportunities. In addition, we propose several sets of benchmark instances for the problem in various settings and provide a detailed evaluation of all the available models with a view to facilitating future research on the solution methods.

show abstract

“…(1) Wait between two consecutive operations of a job: if the no-wait constraint occurs, two successive operations of a job must be processed without any interruption and thus no-wait models are established in different environments: flow shop [55][56][57][58][59][60], hybrid/flexible workshop [61][62][63][64][65], job shop ( [47,[66][67][68]), and open shop [47,54,69].…”

Section: Quantitative Illustrationmentioning

confidence: 99%

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Fei

Shen

2017

Scientific Programming

View full text Add to dashboard Cite

Over the past decades, optimization in operations management has grown ever more popular not only in the academic literature but also in practice. However, the problems have varied a lot, and few literature reviews have provided an overview of the models and algorithms that are applied to the optimization in operations management. In this paper, we first classify crucial optimization areas of operations management from the process point of view and then analyze the current status and trends of the studies in those areas. The purpose of this study is to give an overview of optimization modelling and resolution approaches, which are applied to operations management.

show abstract

Optimal job insertion in the no-wait job shop

Cited by 16 publications

References 10 publications

Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach

Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach

Coupled task scheduling with exact delays: Literature review and models

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Contact Info

Product

Resources

About