Hybrid approach to decision-making for job-shop scheduling

Mesghouni, Khaled; Pesin, P.; Trentesaux, Damien; Hammadi, Slim; Tahón, Christian; Borne, Pierre

doi:10.1080/095372899232768

Cited by 29 publications

(13 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Five instances (4 X 5, 10 X 7, 10 X 10, 15 X 10 and 8 X 8) with partial and total flexibilities are taken from Kacem et al [29,30] . Sixth instance with total flexibility and varying date of availability of the job for processing is taken from Mesghouni et al [31,32] .…”

Section: Resultsmentioning

confidence: 99%

Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling

Shivasankaran¹,

Kumar²,

Raja³

2015

IJCIS

View full text Add to dashboard Cite

Hybrid sorting immune simulated annealing technique (HSISAT), a Meta -heuristic is proposed for solving the multi objective flexible job-shop scheduling problem (FJSP). The major objectives are distributing the time of machines among the set of operations and scheduling them to minimize the criterion (makespan, total workload and maximum workload). The processing time is sorted for isolating the critical machines and immune simulated annealing (ISA) is applied to increase the convergence speed. Several case studies have been taken from the literature to demonstrate the convergence speed of the proposed algorithm. The computational results have proved that the proposed hybrid algorithm is an effective approach to solve the multi-objective FJSP.

show abstract

Section: Resultsmentioning

confidence: 99%

Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling

Shivasankaran¹,

Kumar²,

Raja³

2015

IJCIS

View full text Add to dashboard Cite

show abstract

“…During the last decade, combining two or more methods to solve the same MCDM problem (hybrid MCDM) has been used increasingly to support decision-making. A decision-maker or a [175] Selecting the best scheduling, balancing of workload GAs, CLP, MCDM Mesghouni et al, 1999 [176] Multidimensional Scaling (MDS); Fuzzy Axiomatic Design (FAD); Genetic Algorithms (GAs), and Constraint Logic Programming (CLP).…”

Section: Discussionmentioning

confidence: 99%

“…Mesghouni et al [176] combine genetic algorithm [179], constraint logic programming, and MCDM Analytic for balancing workload by selecting the best scheduling. On the whole, 8 out of 13 applications are dated up to 2011 ( Table 3).…”

Section: Hmcdm Applications In Industrial and Manufacturing Engineerimentioning

confidence: 99%

Hybrid Multiple Criteria Decision Making Methods: A Review of Applications in Engineering

et al. 2016

View full text Add to dashboard Cite

Abstract. To support evaluation and selection processes in engineering, formal decisionmaking methods can be used. A great number of works applying diverse Multiple-Criteria Decision-Making (MCDM) techniques for engineering problems have been published recently. A new approach of hybrid MCDM methods has been developed, rapidly, during the past few years. The current paper aims at lling the gap and summarizing publications related to applications of hybrid MCDM for engineering. The study is limited solely to papers referred in Thomson Reuters Web of Science Core Collection academic database. It aims to review how the papers have been distributed by period of publishing and by country; multiple-criteria decision-making methods have been used, most frequently, in developing hybrid approaches and in domains the methods have been applied for. For a more detailed analysis of applications, journal articles from engineering research area were grouped by research domains and further by analyzed issues. Findings of the current review paper con rm that hybrid MCDM approaches, due to their abilities in integrating di erent techniques, can assist in handling miscellaneous information taking into account stakeholders' preferences when making decisions in engineering.

show abstract

“…The authors assume that jobs have arbitrary processing times and resource requirements and there is a unit supply of the resource at each time period and develop an approximation algorithm for this problem and empirically test its effectiveness in finding the minimum makespan schedules. Mesghouni et al 94 considered the typical job-shop scheduling problem with the primary objective of minimizing the makespan of all jobs to be processed. The solution methodology consisted of a Constrained Logic Programming algorithm that provided initial solutions for the evolutionary optimization process.…”

Section: Background On Multi-criteria Scheduling (Job-shop)mentioning

confidence: 99%