Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan

Aydilek, Asiye; Aydilek, Harun; Allahverdi, Ali

doi:10.1080/00207543.2014.997403

Cited by 30 publications

(6 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, the problem of F3|LBt j,k ≤t j,k ≤UBt j,k |∑C i was investigated by Sotskov et al (2004) where they provided few dominance relations for problem. For some other uncertain scheduling environments, the problem was investigated as well in the literature, e.g., Allahverdi and Allahverdi (2018), Aydilek et al (2013Aydilek et al ( , 2015Aydilek et al ( , 2017, Lai andSotskov (1999), Lai et al (1997).…”

Section: Introductionmentioning

confidence: 99%

An Improved Algorithm for Minimizing Makespan on Flowshops with Uncertain Processing Times

Allahverdi¹,

Allahverdi²

2021

Uluslararası Muhendislik Arastirma Ve Gelistirme Dergisi

View full text Add to dashboard Cite

We address the four-machine flowshop scheduling problem with the objective of minimizing makespan with uncertain processing times The problem was investigated in the literature (RAIRO Operations Research 54, 529-553) and different algorithms were proposed. In this paper, we propose a new algorithm for the problem. The new proposed algorithm is compared with the best existing algorithm in the literature by using extensive computational experiments. Computational experiments show that the new proposed algorithm performs much better than the best existing algorithm in the literature in terms of error while both have the same computational time. Specifically, the new proposed algorithm reduces the error of the best existing algorithm in the literature about 40%. This result has been confirmed by using hypotheses testing with a significance level of 0.01.

show abstract

Section: Introductionmentioning

confidence: 99%

An Improved Algorithm for Minimizing Makespan on Flowshops with Uncertain Processing Times

Allahverdi¹,

Allahverdi²

2021

Uluslararası Muhendislik Arastirma Ve Gelistirme Dergisi

View full text Add to dashboard Cite

show abstract

“…This type of approach tries to produce a schedule or a family of schedules that are relatively insensitive to uncertain factors (Kouvelis et al, 2000). Aydilek et al (2015) studied the two-machine flow shop scheduling problem where processing and setup times are uncertain and bounded to minimize makespan. Fuzzy theory is generally used in such approaches.…”

Section: Introductionmentioning

confidence: 99%

Novel slack-based robust scheduling rule for a semiconductor manufacturing system with uncertain processing time

Liu¹,

Qiao²,

Ma³

et al. 2018

Front. Eng

View full text Add to dashboard Cite

The NP-hard scheduling problems of semiconductor manufacturing systems (SMSs) are further complicated by stochastic uncertainties. Reactive scheduling is a common dynamic scheduling approach where the scheduling scheme is refreshed in response to real-time uncertainties. The scheduling scheme is overly sensitive to the emergence of uncertainties because the optimization of performance (such as minimum make-span) and the system robustness cannot be achieved simultaneously by conventional reactive scheduling methods. To improve the robustness of the scheduling scheme, we propose a novel slack-based robust scheduling rule (SR) based on the analysis of robustness measurement for SMS with uncertain processing time. The decision in the SR is made in real time given the robustness. The proposed SR is verified under different scenarios, and the results are compared with the existing heuristic rules. Simulation results show that the proposed SR can effectively improve the robustness of the scheduling scheme with a slight performance loss.

show abstract

“…In such cases, assuming setup times to be deterministic values may result in poor efficiency, Aydilek et al [8]. Moreover, Aydilek et al [9] state that assuming setup times to follow certain probability distributions may not be accurate. Hence, it is vital to consider problems with uncertain setup times which can be specified by bounds for each job on each machine.…”

mentioning

confidence: 99%

“…Moreover, Allahverdi ( [3], [5], [4]) establish dominance relations for the problems of F2| LBs i,k ≤ s i,k ≤ UBs i,k | C max , F2| LBs i,k ≤ s i,k ≤ UBs i,k | C j , and F2| LBs i,k ≤ s i,k ≤ UBs i,k | L max , respectively, where L max denotes maximum lateness. Furthermore, some heuristics are provided by Aydilek et al [8] for the problem F2| LBs i,k ≤ s i,k ≤ UBs i,k | C max and some others are provided by Aydilek et al [9] for the same problem where processing times are uncertain variables as well. For uncertain environments, researchers investigate different scheduling problems by modeling setup/processing times within certain intervals including Braun et al [10], Sotskov et al [23], Matsveichuk et al [21], Sotskov and Matsveichuk [25], and Sotskov and Lai [24].…”

mentioning

confidence: 99%

“…Therefore, the problem with sequence dependent setup times can be addressed. Moreover, we treated processing times as deterministic which is valid for the majority of scheduling environments, Xie and Chen [28], Aydilek et al [9], and Lu et al [19]. However, it may not be valid for some other environments so an extension to the considered problem is to address the problem where both setup times and processing times are uncertain.…”

mentioning

confidence: 99%

See 1 more Smart Citation

A better dominance relation and heuristics for Two-Machine No-Wait Flowshops with Maximum Lateness Performance Measure

Allahverdi¹,

Aydilek²,

Aydilek³

et al. 2021

JIMO

Self Cite

View full text Add to dashboard Cite

In this paper, we consider a manufacturing system with twomachine no-wait flowshop scheduling problem where setup times are uncertain. The problem with the performance measure of maximum lateness was addressed in the literature (Computational and Applied Mathematics 37, 6774-6794) where dominance relations were proposed. We establish a new dominance relation and show that the new dominance relation is, on average, about 90% more efficient than the existing ones. Moreover, since it is highly unlikely to find optimal solutions for problems of reasonable size by utilizing dominance relations and since there exist no heuristic in the literature for the problem, we propose constructive heuristics to solve real life problems. We conduct extensive computational experiments to evaluate the proposed heuristics. Computational experiments indicate that the performance of the worst proposed heuristic is at least 20% better than a benchmark solution. Furthermore, they also indicate that the best proposed heuristic is about 130% better than the worst one. The average CPU time of the heuristics is significantly less than a second. 2010 Mathematics Subject Classification. 90B36.

show abstract

Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan

Cited by 30 publications

References 25 publications

An Improved Algorithm for Minimizing Makespan on Flowshops with Uncertain Processing Times

An Improved Algorithm for Minimizing Makespan on Flowshops with Uncertain Processing Times

Novel slack-based robust scheduling rule for a semiconductor manufacturing system with uncertain processing time

A better dominance relation and heuristics for Two-Machine No-Wait Flowshops with Maximum Lateness Performance Measure

Contact Info

Product

Resources

About