Scheduling ordered open shops

Liu, C. Y.; Bulfin, Robert L.

doi:10.1016/0305-0548(87)90029-3

Cited by 38 publications

(16 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among the most important scheduling problems is open-shop scheduling, which is widely used in the world of industry. Car repairs, control of central quality, attribution of classes, scheduling inspection and satellite signalling are some of instances discussed by Kubiak et al (1991), Liu and Bulfin (1987) and Prins (1994).…”

Section: Introductionmentioning

confidence: 99%

RETRACTED ARTICLE: OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises

et al. 2015

View full text Add to dashboard Cite

The problem of open-shop scheduling includes a set of activities which must be performed on a limited set of machines. The goal of scheduling in open-shop is the presentation of a scheduled program for performance of the whole operation, so that the ending performance time of all job operations will be minimised. The open-shop scheduling problem can be solved in polynomial time when all nonzero processing times are equal, becoming equivalent to edge coloring that has the jobs and workstations as its vertices and that has an edge for every job-workstation pair with a nonzero processing time. For three or more workstations, or three or more jobs, with varying processing times, open-shop scheduling is NP-hard. Different algorithms have been presented for open-shop scheduling so far. However, most of these algorithms have not considered the machine maintenance problem. Whilst in production level, each machine needs maintenance, and this directly influences the assurance reliability of the system. In this paper, a new genetic-based algorithm to solve the open-shop scheduling problem, namely OSGA, is developed. OSGA considers machine maintenance. To confirm the performance of OSGA, it is compared with DGA, SAGA and TSGA algorithms. It is observed that OSGA performs quite well in terms of solution quality and efficiency in small and medium enterprises (SMEs). The results support the efficiency of the proposed method for solving the open-shop scheduling problem, particularly considering machine maintenance especially in SMEs'.

show abstract

Section: Introductionmentioning

confidence: 99%

RETRACTED ARTICLE: OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises

et al. 2015

View full text Add to dashboard Cite

show abstract

“…One can find this kind of shop in a large aircraft garage with specialized work centers, in automobile repair, quality control centers, semiconductor manufacturing, teacher-class assignments, examination scheduling, and satellite communications as described in [3], [4] and [5].…”

Section: Literature Reviewmentioning

confidence: 99%

A Featured Tuning of the Simulated Annealing Applied to the Open Shop Scheduling

Mohsine¹,

Benhra²,

Oualidi³

2016

IJCA

View full text Add to dashboard Cite

The present paper discusses the open shop scheduling problem using a manual tuning of a simulated annealing algorithm's parameters. A comparison has been done between Taillard's Benchmarks for 60 instances, 2 dispatching rules and 1296 variants of the SA algorithm obtained by changing the initial solution, the epoch length, and the steps' number, the initial temperature, the neighborhood and the cooling scheme.The gotten results lead to some interesting conclusions for the best choice of the parameters.

show abstract

“…We first consider the three-machine proportionate open shop minimum makespan problem (denoted as O3|prpt|C max ) which was shown to be at least ordinary NP-hard by Liu and Bulfin (1987). The authors stated their NP-hardness theorem for the three-machine ordered open shop problem but they actually used an O3|prpt|C max * Corresponding author.…”

Section: Introductionmentioning

confidence: 98%

The three-machine proportionate open shop and mixed shop minimum makespan problems

Koulamas

Kyparisis

2015

European Journal of Operational Research

View full text Add to dashboard Cite

Scheduling ordered open shops

Cited by 38 publications

References 10 publications

RETRACTED ARTICLE: OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises

RETRACTED ARTICLE: OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises

A Featured Tuning of the Simulated Annealing Applied to the Open Shop Scheduling

The three-machine proportionate open shop and mixed shop minimum makespan problems

Contact Info

Product

Resources

About