A two-machine flowshop scheduling problem with precedence constraint on two jobs

Cheng, Shuenn‐Ren; Yin, Yunqiang; Wen, Chih-Hou; Lin, Win-Chin; Li, Jun

doi:10.1007/s00500-015-1908-x

Cited by 6 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This scenario is formally referred to as an ordered precedence constraint, and it affects the best job sequence. It is used to enforce that some set of jobs has to process in the specified order all machines (Gladky et al, 2004;Cheng et al, 2017).…”

Section: Introductionmentioning

confidence: 99%

An ordered precedence constrained flow shop scheduling problem with machine specific preventive maintenance

Kumar¹,

Thangaraj²

2023

10.5267/j.jpm

View full text Add to dashboard Cite

In reality, the machines may interrupt because of the nature of deterioration of the machines. Thus, it is inevitable to perform maintenance alongside production planning. The preventive maintenance is a schedule of strategic operations that are performed prior to the failure occurring, to retain the system operating at the preferred level of consistency. Thus, preventive maintenance plays a significant role in flow shop scheduling models. With its practical significance, this study addresses a practical three-machine n jobs flow shop-scheduling problem (FSSP) in which machine specific preventive maintenance, where each machine is given with a maintenance schedule is considered. In addition, a practical ordered precedence constraint in which some set of jobs has to process in the specified order irrespective of their processing times is also considered. The problem’s goal is to establish the optimal job sequence and preventive maintenance such that the overall cost of tardiness and preventive maintenance is as minimum as possible. An efficient heuristic approach is designed to tackle the present model, resulting in total cost savings. A comparative analysis is not conducted due to absence of studies on the current problem in the literature. However, Computational experiments are carried out on some test instances and results are reported. The reported results may be useful for future studies.

show abstract

Section: Introductionmentioning

confidence: 99%

An ordered precedence constrained flow shop scheduling problem with machine specific preventive maintenance

Kumar¹,

Thangaraj²

2023

10.5267/j.jpm

View full text Add to dashboard Cite

show abstract

“…Since the constraints of the above problems are all different, they needed to tailor their own algorithms to individual needs. For more recent studies about total tardiness minimization on two machines, readers can refer to [10,15,17,20,29].…”

Section: Introductionmentioning

confidence: 99%

A three-agent scheduling problem for minimizing the flow time on two machines

Lee

Wang

2020

RAIRO-Oper. Res.

View full text Add to dashboard Cite

This study introduces a two-machine three-agent scheduling problem. We aim to minimize the total tardiness of jobs from agent 1 subject to that the maximum completion time of jobs from agent 2 cannot exceed a given limit and that two maintenance activities from agent 3 must be conducted within two maintenance windows. Due to the NP-hardness of this problem, a genetic algorithm (named GA+) is proposed to obtain approximate solutions. On the other hand, a branch-and-bound algorithm (named B&B) is developed to generate the optimal solutions. When the problem size is small, we use B&B to verify the solution quality of GA+. When the number of jobs is large, a relative deviation is proposed to show the gap between GA+ and another ordinary genetic algorithm. Experimental results show that the proposed genetic algorithm can generate approximate solutions by consuming reasonable execution time.

show abstract

“…There are many more works devoted to approximate algorithms: construction, metaheuristic ones and their hybrids. Especially interesting seem to be the works that have appeared in recent years: Ahmadi et al [1], Cheng et al [10], as well as Ardakan et al [3] and Bożejko et al [7]. There are also new, promising methods of local search, using new neighborhoods, such as the golf one (e.g.…”

Section: Introductionmentioning

confidence: 99%

Bulletin of the Polish Academy of Sciences: Technical Sciences

Bożejko

Uchroński

Wodecki

2020

View full text Add to dashboard Cite

The paper discusses a two-machine flow shop problem with minimization of the sum of tardiness costs, being a generalization of the popular NP-hard single-machine problem with this criterion. We propose the introduction of new elimination block properties allowing for accelerating the operation of approximate algorithms of local searches, solving this problem and improving the quality of solutions determined by them.

show abstract

A two-machine flowshop scheduling problem with precedence constraint on two jobs

Cited by 6 publications

References 34 publications

An ordered precedence constrained flow shop scheduling problem with machine specific preventive maintenance

An ordered precedence constrained flow shop scheduling problem with machine specific preventive maintenance

A three-agent scheduling problem for minimizing the flow time on two machines

Bulletin of the Polish Academy of Sciences: Technical Sciences

Contact Info

Product

Resources

About