A two-stage three-machine assembly scheduling problem with a position-based learning effect

doi:10.1080/00207543.2017.1401243

A two-stage three-machine assembly scheduling problem with a position-based learning effect

2017-11-15

36

PRE

AI

DOI：10.1080/00207543.2017.1401243

Original

Original request for help

Save

Abstract

En 中文

The two-stage assembly scheduling problem has attracted increasing research attention. In many such problems, job processing times are commonly assumed to be fixed. However, this assumption does not hold in many real production situations. In fact, processing times usually decrease steadily when the same task is performed repeatedly. Therefore, in this study, we investigated a two-stage assembly position-based learning scheduling problem with two machines in the first stage and an assembly machine in the second stage. The objective was to complete all jobs as soon as possible (or to minimise the makespan, implying that the system can perform better and efficient task planning with limited resources). Because this problem is NP-hard, we derived some dominance relations and a lower bound for the branch-and-bound method for finding the optimal solution. We also propose three heuristics, three versions of the simulated annealing (SA) algorithm, and three versions of cloud theory-based simulated annealing algorithm for determining near-optimal solutions. Finally, we report the performance levels of the proposed algorithms.

Keywords:

assembly

simulated annealing

discrete optimisation

branch-and-bound

flow shop

A two-stage three-machine assembly scheduling problem with a position-based learning effect

Abstract

Journal

Organization