English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Article history: Received July 22, 2011 Received in Revised form October, 12, 2011 Accepted 15 October 2011 Available online 25 October 2011 This paper deals with a single-machine scheduling problem with maintenance activities. Our purpose is to provide a near optimal solution using metaheuristics approach. In this problem, there are jobs and machines ( > ), each job must be assigned to one and only one machine, where the processing time of job ( ) is ( ). Furthermore there are groups where each group has a fix periodic interval T and for each group, the maximum number of jobs processed in the machines available time interval ( ) is , = . For finding the near optimal solution, we consider optimizing total cost scheduling problem. This problem has two types of costs, group cost and gap cost. In this study, first, proposed problem is formulated in a mathematical model. Next, a heuristic genetic algorithm is used to obtain the proposed problem and on example is presented to verify the efficiency of the algorithm. © 2012 Growing Science Ltd. All rights reserved.

Optimization costs of the single-machine scheduling problem with maintenance activities by using genetic algorithm