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

Lee, Wen‐Chiung; Wang, Jen-Ya

doi:10.1051/ro/2019088

Cited by 3 publications

(2 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-Some non-preemptive lower bounds are helpful for improving the efficiency of a branch-and-bound algorithm, for preemption may lead to underestimations of actual objective costs. -Some mathematical analyses, e.g., [31], can help a metaheuristic algorithm to accelerate its execution speed.…”

Section: Discussionmentioning

confidence: 99%

A makespan minimization problem for versatile developers in the game industry

Su¹,

Wang

2022

RAIRO-Oper. Res.

Self Cite

View full text Add to dashboard Cite

Today, the development of a modern video game draws upon multiple areas of expertise. Moreover, its development cost could be as high as tens of millions of dollars. Consequently, we should carefully schedule its jobs so as not to increase the total cost. However, project leaders traditionally treat developers alike or even schedule all the jobs manually. In this study, we consider a versatile-developer scheduling problem. The objective is to minimize the makespan of a game project. We propose a branch-and-bound algorithm (B&B) to generate the optimal schedules for small problem instances. On the other hand, an imperialist competitive algorithm (ICA) is proposed to obtain approximate schedules for large problem instances. Lastly, computational experiments are conducted to show the performances of both algorithms. When the problem size is small (e.g. n <= 12), B&B can generate the optimal schedules within 5 seconds. For some large problem instances (e.g., n = 600), near-optimal schedules can be obtained by ICA within 10 minutes. The final results imply that both algorithms converge quickly and are of high solution quality.

show abstract

Section: Discussionmentioning

confidence: 99%

A makespan minimization problem for versatile developers in the game industry

Su¹,

Wang

2022

RAIRO-Oper. Res.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Ðurasević and Veronique et al considered the flow time of jobs in the system as an essential criterion in measuring the performance of a DR and reviewed the applicability of multiple DRs in different manufacturing systems [20,21]. Moreover, Lee and Wang [22] realized the optimization of the job shop scheduling problem with two machines to minimize the flow time of the job, thereby reducing the total delay of the job in the manufacturing system. e flow time F j of job j in the manufacturing system is shown in equation (1), where C j represents the completion moment of job j and r j denotes the moment when job j is released to the system.…”

Section: Jssp Analysismentioning

confidence: 99%

Model for Selecting Optimal Dispatching Rules Based Real-time Optimize Job Shop Scheduling Problem

Zhao

Liu

Huang

et al. 2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Owing to the randomness of the job release time, it is not possible to obtain all job information in real time during the operation of a manufacturing system. Generating a suitable scheduling strategy at the correct moment is the focus of addressing this disturbance. In this study, the flow time of the job in the manufacturing system was used as a criterion for evaluating the performance of the scheduling strategy. Subsequently, a model was constructed for selecting the optimal dispatching rule (DR) to actively change the scheduling strategies during the production process. The constructed model for selecting the optimal DR included an initial model for selecting the optimal DR and an evaluation model. The initial model for selecting the optimal DR outputs a DR with better performance based on the attributes of the job to be scheduled in the manufacturing system. Meanwhile, the evaluation model is responsible for evaluating the DR output of the initial model for selecting the optimal DR and determining whether the DR needs to be updated; the update process is realized based on simulation technology. Following experimental verification, the constructed model could generate scheduling strategies with superior performance in real-time and realize the update of the historical database. The results of this study will be of reference significance for solving the disturbance problem encountered by the manufacturing system in real time.

show abstract

A job scheduling and rejection problem considering self-contained and cross-functional jobs

Chen,

Wang

2024

RAIRO-Oper. Res.

View full text Add to dashboard Cite

In today’s large projects and complex assembly lines, a single multi-skilled worker often needs to complete jobs requiring multiple areas of expertise. Even if a worker possesses all necessary skills, their proficiency can vary. This variability makes it challenging to assess a job’s cost-performance ratio before assignment. Larger problem sizes often involve many such jobs that need scheduling or rejection. Clearly, the processing times and workers in the presented problem are more complex than traditional scheduling problems with single-valued processing times and single-functional machines. Two important observations serve as the motivation. First, traditional genetic algorithms with fixed-length chromosomes may not effectively handle the complexity of self-contained and cross-functional jobs and multi-skilled workers. Second, traditional genetic algorithms cannot guarantee a certain level of solution quality. Motivated by these observations, a novel genetic algorithm is developed. This algorithm can quickly search the solution space using an outbreeding technique. Additionally, an upper bound is provided to ensure solution quality. Experimental results demonstrate that the proposed genetic algorithm is superior to others through comprehensive comparisons.

show abstract

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

Cited by 3 publications

References 57 publications

A makespan minimization problem for versatile developers in the game industry

A makespan minimization problem for versatile developers in the game industry

Model for Selecting Optimal Dispatching Rules Based Real-time Optimize Job Shop Scheduling Problem

A job scheduling and rejection problem considering self-contained and cross-functional jobs

Contact Info

Product

Resources

About