Job-shop scheduling using hybrid shuffled frog leaping

Ahandani, Morteza Alinia; Shirjoposht, Naser Pourqorban; Banimahd, Reza

doi:10.1109/csicc.2009.5349656

Cited by 2 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The SFLA comprises a set of interacting virtual population of frogs partitioned into different group's population memeplexes which are referred to searching for food [12]. The algorithm functions are simultaneously independent in local search of each memeplex [13]. SFHM algorithm was used for minimizing mean tardiness and mean flow time multi objective criteria [14][15].…”

Section: Introductionmentioning

confidence: 99%

Solving Job Shop Scheduling Problem Based on Employee Availability Constraint

Ramya

Chandrasekaran

2013

AMM

View full text Add to dashboard Cite

Manufacturing System is enabled with an excellent knowledge on production plan, proper scheduling of machinery process, employee timetabling and labor costs. Heuristic algorithms are developed to bring optimized results in stipulated time with respect to optimum schedule. This article deals with minimizing the maximum completion time (makespan) based on job scheduling and minimization of labor costs based on employee workload with Shuffled Frog Leaping Algorithm and Sheep Flock Heredity Model Algorithm. The labor costs minimization and makespan which is to find a schedule that satisfies the organizations rules, employees preferences, due date and customers. The formulation of assigning workload for employees is concerned with assigning number of employees into a given set of shifts over a fixed period of time and week task. The main problem attempts to minimize labor costs based on performance criteria and assigning the loads equally among all employees. Several local search methods and heuristics algorithms has been proposed in many research on Job shop scheduling. The Results are compared with other heuristics in terms of makespan, idle time and Labor costs the Shuffled Frog Leaping algorithm performs result oriented than other Heuristics Algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

Solving Job Shop Scheduling Problem Based on Employee Availability Constraint

Ramya

Chandrasekaran

2013

AMM

View full text Add to dashboard Cite

show abstract

Solving the parameter identification problem using shuffled frog leaping with opposition-based initialization

Ahandani

Banimahd

Shrjoposht

2011

2011 1st International eConference on Computer and Knowledge Engineering (ICCKE)

View full text Add to dashboard Cite

The parameter identification problem can be modeled as a non-linear optimization problem. In this problem, some unknown parameters of a mathematical model presented by an ordinary differential equation using some experimental data must be estimated. This paper presents a shuffled frog leaping algorithm for solving parameter identification problem. An opposition-based initialization strategy is used to choose the fitter members as initial population. Two test cases are considered to examine the efficiency of utilized algorithm. The comparison results of shuffled frog leaping and other methods proposed in the different literature demonstrate that the shuffled frog leaping has a comparable performance than other evolutionary algorithms.

show abstract

Job-shop scheduling using hybrid shuffled frog leaping

Cited by 2 publications

References 10 publications

Solving Job Shop Scheduling Problem Based on Employee Availability Constraint

Solving Job Shop Scheduling Problem Based on Employee Availability Constraint

Solving the parameter identification problem using shuffled frog leaping with opposition-based initialization

Contact Info

Product

Resources

About