Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect

Rudek, Radosław

doi:10.1016/j.cie.2011.02.005

Cited by 55 publications

(18 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It follows from the observations that algorithms constructed on the basis of the classical models usually provide unsatisfactory (unstable) solutions for real-life flowshop problems, since these models do not take into consideration additional factors that are significant in practice, e.g. sequence-dependent setup times [16,20] or variable processing times [2,4,5,23,27,31]. To this group belong the described real-life problems, where a deterioration of machines (understood as chemical cleaning baths, lathe machines, human workers etc.)…”

mentioning

confidence: 99%

On flowshop scheduling problems with the aging effect and resource allocation

Rudek

2011

Int J Adv Manuf Technol

Self Cite

View full text Add to dashboard Cite

In this paper, we focus on real-life settings that require the development of new models of flowshop scheduling problems, where job processing times can increase with the number of processed jobs due to the aging effect and decrease by the allocation of additional resource. We analyse the makespan minimization flowshop problem with such model and also with the aging effect only. We prove that the considered problems and their special cases are still polynomially solvable under given conditions, and on their basis, we provide optimal polynomial time solution algorithms.

show abstract

mentioning

confidence: 99%

On flowshop scheduling problems with the aging effect and resource allocation

Rudek

2011

Int J Adv Manuf Technol

Self Cite

View full text Add to dashboard Cite

show abstract

“…They provide a branch-and-bound algorithm that could solve instances with up to 16 jobs. Rudek (2011) studies the two-machine flowshop problem to minimize the makespan. He shows that an optimal solution is not necessarily a permutation schedule when the learning effect is taken into consideration.…”

Section: Introductionmentioning

confidence: 99%

Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time

Shiau

Tsai

Lee

et al. 2015

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…They showed some single-machine problems remain polynomially solvable. Rudek [20] analyzed the makespan problem on two-machine flowshop with learning effects. First, he showed that an optimal solution of this problem does not have to be the 'permutation' schedule if the learning effect is taken into consideration.…”

Section: Introductionmentioning

confidence: 99%

A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time

Lee

2011

Computers & Mathematics with Applications

View full text Add to dashboard Cite

a b s t r a c tIn this paper, we study a scheduling model with the consideration of both the learning effect and the setup time. Under the proposed model, the learning effect is a general function of the processing time of jobs already processed and its scheduled position, and the setup time is past-sequence-dependent. We then derive the optimal sequences for two single-machine problems, which are the makespan and the total completion time. Moreover, we showed that the weighted completion time, the maximum lateness, the maximum tardiness, and the total tardiness problems remain polynomially solvable under agreeable conditions.

show abstract

Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect

Cited by 55 publications

References 43 publications

On flowshop scheduling problems with the aging effect and resource allocation

On flowshop scheduling problems with the aging effect and resource allocation

Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time

A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time

Contact Info

Product

Resources

About