A Classification Schema for the Job Shop Scheduling Problem with Transportation Resources: State-of-the-Art Review

Nouri, Houssem Eddine; Driss, Olfa Belkahla; Ghédira, Khaled

doi:10.1007/978-3-319-33625-1_1

Cited by 21 publications

(9 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Khannan et al (2016) developed a linear programming model to determine dynamic lot size in MH for cellular manufacturing system design. The type of MH resource, its number and route flexibility significantly influence the scheduling of manufacturing operations (Nouri et al, 2016). These are some of the limited literature that is available in the research works carried out in the domain of MH.…”

Section: Literature Reviewmentioning

confidence: 99%

Setting-up material handling network in manufacturing systems using graph theory

Gupta

2018

JAMR

View full text Add to dashboard Cite

Purpose Material handling (MH) is an important facility in any manufacturing system. It facilitates the transport of in-process material from one workstation (WS) to another. MH devices do imply incurring capital costs and, therefore, minimizing their deployment without compromising on smooth material flow will ensure savings in addition to the optimal use of productive shop floor space and, avoid space cluttering. The purpose of this paper is to evaluate the minimal network that connects all the WSs, therefore ensuring economic and safe manufacturing operations. Design/methodology/approach Graph theoretical approach and Prim’s algorithm for minimal spanning tree is used to evaluate the minimal span of the MH devices. The algorithm is initialized by translating the graph of WSs into a distance matrix to evaluate the minimal MH network. Findings The minimal length of the MH devices is evaluated for a typical case study. Research limitations/implications The step-by step methodology explained in the manuscript acts as a good guide for practicing operational managers. The shortcoming of the methodology is that, it presumes the use of modular MH devices that will need to be reconfigured based on dynamic changes to the manufacturing system. Practical implications The methodology is explained in detail to enable the practicing managers to use it for designing their MH networks in any manufacturing system. Originality/value There is no evidence to indicate the use of minimal spanning tree algorithm for design of MH networks in a manufacturing system. This paper attempts to fill this gap.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Setting-up material handling network in manufacturing systems using graph theory

Gupta

2018

JAMR

View full text Add to dashboard Cite

show abstract

“…Other mathematical formulations are provided by Caumond et al [7] considering a single AGV with limited buffer and Fazlollahtabar considering multiple AGVs and turning points for deadlock resolution [11]. Given that scheduling AGVs in a job shop is considered NP-hard due to the simultaneous scheduling problems (i) of the machines and (ii) the AGVs in the job shop [22] typical approaches are heuristic algorithms. Scholz-Reiter et al [24] presented a solution for general dual resource constrained problems dynamically adjusting scheduling rules based on the environment, which can be adopted to AGVs.…”

Section: Problem Descriptionmentioning

confidence: 99%

“…Considering the possible optimization criteria in general, the minimization of the make span is sufficient [22]. Fazlollahtabar et al [10] presented the minimization of the make span (Cmax) as a goal criterion, but considered (weighted) tardiness or the mean flowtime as minimization criteria as well.…”

Section: Problem Descriptionmentioning

confidence: 99%

Optimal Scheduling for Automated Guided Vehicles (AGV) in Blocking Job-Shops

Heger

Voß

2017

Advances in Production Management Systems. The Path to Intelligent, Collaborative and Sustainable Manufacturing

View full text Add to dashboard Cite

Promising developments and further improvements of cyber physical logistics systems (CPLS) and automated guided vehicles (AGV) lead to broader application of such systems in production environments and smart factories. In this study a new mixed integer linear program (MILP) is presented for the scheduling of AGVs in a flexible reentrant job shop with blocking. Optimal solutions to small instances of the complex scheduling problem in a make-to-order production, minimizing the make span, are calculated. Different numbers of jobs are considered. Feasible schedules for the machines and the AGVs are generated from different sized instances to evaluate the limits of the mathematical model.

show abstract

“…Many approaches have been proposed to solve FJSP since first presented in 1990 [4]. The current methods for solving FJSP can be mainly categorized into; exact algorithm, dispatching rules (DR), evolutionary algorithm (EA), swarm intelligence (SI) based approaches, local search (LS) algorithms, and so on [5].…”

Section: Introductionmentioning

confidence: 99%

A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem

Aqel

Gao

2019

Chin. J. Mech. Eng.

View full text Add to dashboard Cite

The flexible job shop scheduling problem (FJSP) is considered as an important problem in the modern manufacturing system. It is known to be an NP-hard problem. Most of the algorithms used in solving FJSP problem are categorized as metaheuristic methods. Some of these methods normally consume more CPU time and some other methods are more complicated which make them difficult to code and not easy to reproduce. This paper proposes a modified iterated greedy (IG) algorithm to deal with FJSP problem in order to provide a simpler metaheuristic, which is easier to code and to reproduce than some other much more complex methods. This is done by separating the classical IG into two phases. Each phase is used to solve a sub-problem of the FJSP: sequencing and routing sub-problems. A set of dispatching rules are employed in the proposed algorithm for the sequencing and machine selection in the construction phase of the solution. To evaluate the performance of proposed algorithm, some experiments including some famous FJSP benchmarks have been conducted. By compared with other algorithms, the experimental results show that the presented algorithm is competitive and able to find global optimum for most instances. The simplicity of the proposed IG provides an effective method that is also easy to apply and consumes less CPU time in solving the FJSP problem.

show abstract

A Classification Schema for the Job Shop Scheduling Problem with Transportation Resources: State-of-the-Art Review

Cited by 21 publications

References 28 publications

Setting-up material handling network in manufacturing systems using graph theory

Setting-up material handling network in manufacturing systems using graph theory

Optimal Scheduling for Automated Guided Vehicles (AGV) in Blocking Job-Shops

A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem

Contact Info

Product

Resources

About