A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling

Wang, Shijin; Liu, Ming; Chen, Chu

doi:10.1080/00207543.2014.949363

Cited by 76 publications

(22 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Toktaş, Azizoğlu, and Köksalan 2004;Lin and Wu 2006;Wang, Liu, and Chu 2015). For instance, Lemesre, Dhaenens and Talbi (2007) developed an exact method based on the branch and bound approach to solve a permutation flow shop, which is in fact a parallel model to improve search speed.…”

Section: Literature Reviewmentioning

confidence: 99%

Grouping and sequencing product variants based on setup similarity

Navaei

ElMaraghy

2016

International Journal of Computer Integrated Manufacturing

View full text Add to dashboard Cite

In some flow shop environments, set-up times between product variants have an important role and are considered more significant than processing times. Therefore, optimal sequence of various product variants is based on improving machine utilisation. A flow shop environment which addresses the set-up criterion where bypassing is not permitted is considered in this paper. A mathematical model is developed and solved using GAMS optimisation software. The non-linear model is then linearised to find exact solutions. A new policy for sequencing product variants is proposed and compared to the exact solutions obtained from GAMS. This sequencing policy capitalises on the commonality between product variants to increase sequencing efficiency. The developed sequencing policy is simple and easy to apply in manufacturing environments. A case study in the label stickers making industry is used for demonstration and validation. Numerical results indicate that the proposed sequencing policy is capable of finding good, and exact solutions in some cases, in less than one second for all studied small, medium and large problem sizes. The solutions obtained using the proposed sequencing policy has a total average of 1.2% relative error which is quite comparable with the solutions obtained using GAMS.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Grouping and sequencing product variants based on setup similarity

Navaei

ElMaraghy

2016

International Journal of Computer Integrated Manufacturing

View full text Add to dashboard Cite

show abstract

“…Exact algorithms mainly include integer programming, the branch and bound method, and other methods. Wang et al [16] used the branch and bound algorithm to study a class of two-stage HFSPs below 20 jobs. However, the applicability of the method is limited as the number of jobs increases.…”

mentioning

confidence: 99%

Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation

et al. 2020

View full text Add to dashboard Cite

Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy. The permutation flow shop scheduling problem and hybrid flow shop scheduling problems are important production scheduling types, which widely exist in industrial production fields. This study aimed to acquire the best scheduling strategy for making production plans. An improved fireworks algorithm is proposed to minimize the makespan in the proposed strategies. The proposed improved fireworks algorithm is compared with the fireworks algorithm, and the improvement strategies include the following: (1) A nonlinear radius is introduced and the minimum explosion amplitude is checked to avoid the waste of optimal fireworks; (2) The original Gaussian mutation operator is replaced by a hybrid operator that combines Cauchy and Gaussian mutation to improve the search ability; and (3) An elite group selection strategy is adopted to reduce the computing costs. Two instances from the permutation flow shop scheduling problem and hybrid flow shop scheduling problems were used to evaluate the improved fireworks algorithm's performance, and the computational results demonstrate the improved fireworks algorithm's superiority.

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

A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling

Cited by 76 publications

References 22 publications

Grouping and sequencing product variants based on setup similarity

Grouping and sequencing product variants based on setup similarity

Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation

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

Contact Info

Product

Resources

About