On the exact solution of the no-wait flow shop problem with due date constraints

Samarghandi, Hamed; Behroozi, Mehdi

doi:10.1016/j.cor.2016.12.013

Cited by 42 publications

(8 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-The possibilities of PFS schemes outperforming NPFS schedules increase for a range of processing times [36,74]. -For a broader range of release-date constraints, the PFS scheme outperforms the NPFS scheme [128,129]. Table 4.…”

Section: Permutation and Non-permutation Complexity: Special Casesmentioning

confidence: 99%

Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review

2021

View full text Add to dashboard Cite

Flow shop scheduling is a type of scheduling where sequence follows for each job on a set of machines for processing. In practice, jobs in flow shops can arrive at irregular times, and the no-wait constraint allows the changes in the job order to flexibly manage such irregularity. The flexible flow shop scheduling problems with no-wait have mainly addressed for flow optimization on the shop floor in manufacturing, processing, and allied industries. The scope of this paper is to identify the literature available on permutation and non-permutation flow shop scheduling with no-wait constraint. This paper organizes scheduling problems based on performance measures of variability and shop environments. The extended summary of two/three-machine and m-machine problems has been compiled, including their objectives, algorithms, parametric considerations, and their findings. A systematic appearance of both conceptual and analytical results summarizes various advances of the no-wait constraint. The paper includes independently investigated problems and suggestions for future research directions.

show abstract

Section: Permutation and Non-permutation Complexity: Special Casesmentioning

confidence: 99%

Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review

2021

View full text Add to dashboard Cite

show abstract

“…Some studies addressed the no-wait flow shop scheduling problem with several machines, but considered job scheduling instead of the batches (Tasgetiren et al 2011;Sapkal and Laha 2013;Allahverdi andAydilek 2013, 2014;Samarghandi and Behroozi 2017;Koulamas and Panwalkar 2018). A survey of research on no-wait flow shop batching scheduling problems was conducted by Oulamara (2012) and Allahverdi (2016).…”

Section: Literature Reviewmentioning

confidence: 99%

Production scheduling problem in a factory of automobile component primer painting

Singgih

Kim

et al. 2020

J Intell Manuf

View full text Add to dashboard Cite

In a factory of automobile component primer painting, various automobile parts are attached to overhead hangers in a conveyor line and undergo a series of coating processes. Thereafter, the components are wrapped at a packaging station. The packaging process should be fully balanced by an appropriate sequence of components to prevent the bottleneck effect because each component requires different packaging times and materials. An overhead hanger has a capacity limit and can hold varying numbers of components depending on the component type. Capacity loss can occur if the hanger capacity is not fully utilized. To increase hanger utilization, companies sometimes mix two or more component types on the same hangers, and these hangers are called mixed hangers. However, mixed hangers generally cause heavy workload because different items require additional setup times during hanging and packing processes. Hence, having many mixed hangers is not recommended. A good production schedule requires a small number of mixed hangers and maximizes hanger utilization and packaging workload balance. We show that the scheduling problem is NP-hard and develop a mathematical programming model and efficient solution approaches for the problem. When applying the methods to solve real problems, we also use an initial solution-generating method that minimizes the mixing cost, set a rule for hanging the items on hangers considering eligibility constraint, and decrease the size of tabu list in proportion to the remaining computational time for assuring intensification in the final iterations of the search. Experimental results demonstrate the effectiveness of the proposed approaches.

show abstract

“…The same problem has been addressed in [15] developing new bounds able to cope with a number of jobs to schedule greater than 20. In [16], the special case of the no-wait flow shop problem with due dates is considered and a mixed integer programming model, two quadratic mixed integer programming models, two constraint programming models and a novel graph representation are provided. The aim is to identify a large number of infeasible solutions and support exact solution algorithms based on the enumeration of the remaining possible schedules.…”

Section: State Of the Artmentioning

confidence: 99%

A branch-and-bound approach to schedule a no-wait flow shop to minimize the CVaR of the residual work content

Urgo

2019

Computers & Industrial Engineering

View full text Add to dashboard Cite

On the exact solution of the no-wait flow shop problem with due date constraints

Cited by 42 publications

References 57 publications

Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review

Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review

Production scheduling problem in a factory of automobile component primer painting

A branch-and-bound approach to schedule a no-wait flow shop to minimize the CVaR of the residual work content

Contact Info

Product

Resources

About