Total flow time minimization in a flowshop sequence-dependent group scheduling problem

Salmasi, Nasser; Logendran, Rasaratnam; Skandari, M. Reza

doi:10.1016/j.cor.2009.04.013

Cited by 87 publications

(46 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this section, we developed some new constraints that can simplify solving the subproblems so that the sequence of the jobs at each machine can be determined, easily. These constraints are inspired by salmasi et al [26]. For this purpose, we suppose that jobs j and l must be processed on machine k at stage i,…”

Section: First Approach: Simplification Of Subproblemsmentioning

confidence: 99%

Lagrangian relaxation approach to minimize makespan for hybrid flow shop scheduling problem with unrelated parallel machines

Asadi-Gangraj

2017

Scientia Iranica

View full text Add to dashboard Cite

This research addresses scheduling problem of n jobs on a Hybrid Flow Shop (HFS) with unrelated parallel machines in each stage. A monolithic mixed integer linear programming (MILP) model is presented to minimize the maximum completion time (makespan). As the research problem is shown to be strongly NP-hard, a Lagrangian relaxation (LR) algorithm is developed to handle the HFS scheduling problem. We design two approaches, simplification of subproblems and dominance rules, to solve the subproblems which are generated in each iteration. For evaluation purposes, numerical experiments with small and large size problems are randomly generated with up to 50 jobs and four stages. The experimental results show that the Lagrangian relaxation approaches outperform the MILP model with respect to CPU time. Furthermore, from the results, it can be conclude that the simplification of subproblems shows slightly better solutions in comparison with dominance rules to solve the subproblems.

show abstract

Section: First Approach: Simplification Of Subproblemsmentioning

confidence: 99%

Lagrangian relaxation approach to minimize makespan for hybrid flow shop scheduling problem with unrelated parallel machines

Asadi-Gangraj

2017

Scientia Iranica

View full text Add to dashboard Cite

show abstract

“…Ashhari (2012) studied no-wait flexible flowshop group scheduling problem with sequence-dependent setup times for the first time. Salmasi et al (2011) studied total flow time minimization in a flow shop group scheduling problem by considering sequence dependent setup times. Ruiz et al (2005) used metaheuristic algorithms for solving the flow shop scheduling problem with sequence setup times.…”

Section: Literature Reviewmentioning

confidence: 99%

Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown

Adressi

Hassanpour²,

Azizi³

2016

10.5267/j.dsl

View full text Add to dashboard Cite

“…The results showed GA-based metaheuristic could obtain a better solution, while SA-based metaheuristic could get solutions with less elapsed time. Salmasi et al (2010) developed a mathematical programming model for the flow shop sequence dependent group scheduling (FSDGS) and proposed a hybrid ant colony optimisation (HACO) algorithm to minimise the total flow time. Vallada and Ruiz (2011) studied the parallel machine scheduling problem with sequence dependent setup times with the objective of minimising the makespan, and designed a new GA for it.…”

Section: Ffsp With Sequence Dependent Setup Timesmentioning

confidence: 99%

Multiple rules with game theoretic analysis for flexible flow shop scheduling problem with component altering times

Han

Zhu

et al. 2016

IJMIC

View full text Add to dashboard Cite

This paper studies the flexible flow shop scheduling problem with component altering times (FFSP-CAT), which is a specific form of the flexible flow shop scheduling problem with sequence dependent setup times in the practical scenario. Dealing with FFSP-CAT includes the jobs' machine assignment determination and the globe optimisation. We develop six rules for jobs' machine assignment, and since these rules will easily conflict with one another if they are used with the same priorities, we construct a repeated cooperative model and provide a game theoretical analysis, then derive a Nash equilibrium machine assignment scheme (NEMAS) to effectively manage these rules for jobs' machines assignment at each stage. Furthermore, to achieve the global optimum, we design an advanced compact genetic algorithm (ACGA). By combining NEMAS and ACGA, an approach named advanced compact genetic algorithm with Nash equilibrium machine assignment scheme (ACGA-NEMAS) is used for minimising the makespan of FFSP-CAT. Through extensive comparison experiments with different scales of instances, we show that the algorithm with NEMAS acquires 56.85% improvement over the algorithm without NEMAS, and ACGA-NEMAS performs 80.28% better than genetic algorithm.

show abstract

Total flow time minimization in a flowshop sequence-dependent group scheduling problem

Cited by 87 publications

References 17 publications

Lagrangian relaxation approach to minimize makespan for hybrid flow shop scheduling problem with unrelated parallel machines

Lagrangian relaxation approach to minimize makespan for hybrid flow shop scheduling problem with unrelated parallel machines

Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown

Multiple rules with game theoretic analysis for flexible flow shop scheduling problem with component altering times

Contact Info

Product

Resources

About