Complexity of flow shop scheduling problems with transportation constraints

Soukhal, Ameur; Oulamara, Ammar; Martineau, Patrick

doi:10.1016/j.ejor.2003.03.002

Cited by 88 publications

(34 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, it should be noted that the complexity of integrated models with di erent assumptions was studied by many researchers in literature (e.g. [1,15,29,30,34]). …”

Section: Literature Reviewmentioning

confidence: 99%

A Joint Scheduling of Production and Distribution Operations in a Flow Shop Manufacturing System

2017

View full text Add to dashboard Cite

Abstract. In traditional scheduling problems and many real-world applications, the production operations are scheduled regardless of distribution decisions. Indeed, the completion time of a job in such problems is de ned traditionally as the time when the production sequences of a job are nished. However, in many practical environments, completed orders are delivered to customers immediately after production stages without any further inventory storage. Therefore, in this paper, we investigate an integrated scheduling model of production and distribution problems simultaneously. It is assumed that products proceed through a permutation ow shop scheduling manufacturing system and are delivered to customers via available vehicles. The objective of our integrated model is to minimize the Maximum Returning Time (MRT), which is the time it takes for the last vehicle to deliver the last order to a relevant customer and return to production center. The problem is formulated mathematically, and then an Improved Imperialist Competitive Algorithm (I-ICA) is proposed for solving it. Furthermore, a su cient number of test problems are generated for computational study. Various parameters of the algorithm are analyzed to calibrate the algorithm by means of the Taguchi method. At the end, the e ectiveness of the proposed model and suggested algorithm is evaluated through a computational study where the obtained results show the appropriate performance of the integrated model and solving approach in comparison to those of the other algorithms.

show abstract

“…Finally, it should be noted that the complexity of integrated models with di erent assumptions was studied by many researchers in literature (e.g. [1,15,29,30,34]). …”

Section: Literature Reviewmentioning

confidence: 99%

A Joint Scheduling of Production and Distribution Operations in a Flow Shop Manufacturing System

2017

View full text Add to dashboard Cite

show abstract

“…Secondly, scheduling of jobs to machines either in job shop or FMS environment is proved to be NP-hard problem [12]. Simultaneously, scheduling of machines and AGV is the only means of ensuring the validity of all the individual schedules [2].…”

Section: Literature Reviewmentioning

confidence: 99%

Hybrid multiobjective genetic algorithms for integrated dynamic scheduling and routing of jobs and automated-guided vehicle (AGV) in flexible manufacturing systems (FMS) environment

Umar

Ariffin

Ismail

et al. 2015

Int J Adv Manuf Technol

104

View full text Add to dashboard Cite

The paper presents an algorithm for integrated scheduling, dispatching, and conflict-free routing of jobs and AGVs in FMS environment using a hybrid genetic algorithm. The algorithm generates an integrated schedule and detail routing paths while optimizing makespan, AGV travel time, and penalty cost due to jobs tardiness and delay as a result of conflict avoidance. The multi-objective fitness function use adaptive weight approach to assign weights to each objective for every generation based on objective improvement performance. Fuzzy expert system is used to control genetic operators using the overall population performance improvements of the last two previous generations. Computational experiments was conducted on the developed algorithm coded in Matlab to test the effectiveness of the algorithm. Integrated scheduling of jobs in FMS which are in synchrony with AGV dispatching, scheduling, and routing proved to ensure the feasibility and effectiveness of all the solutions of the integrated constituent elements.

show abstract

“…Hurink [28] assumed that unlimited buffer spaces exist between the machines, and all transportation is accomplished through a single robot. Soukhal et al [29] analyzed two-machine FS scheduling problems with transportation and assumed that finished jobs are transported from the processing facility and delivered to customers by trucks. In the other words, both transportation capacity and transportation times were explicitly taken into account.…”

Section: Literature Reviewmentioning

confidence: 99%

An electromagnetism-inspired method for a generalized flowshop problem

Khalili

2014

Manufacturing Rev.

View full text Add to dashboard Cite

-There are two common simplifying assumptions made in the scheduling of operations. One is that machines are available continuously, and the other is that once a job completes one process it is immediately available for its next. Moreover, in flowshops, it is commonly assumed that jobs must visit all machines. In practice, however, these assumptions may not be justifiable in some applications. This paper deals with a generalized flow shop (GFS) problem with machine availability constraints, transportation times between stages, and machine skipping. The electromagnetism-like method (EM) has been successfully applied to some NP-hard problems and this has motivated us to apply and assess the effectiveness of an EM algorithm in the GFS scenarios. Simulated annealing (SA) and a number of other well-recognized heuristics to the given GFS scheduling problem that minimizes two independent objective functions, namely the total tardiness and the total completion time also has been applied. In order to evaluate the performance of the proposed EM and SA, a set of practical instances has been considered. The related results are analyzed in two parts; in term of the objective functions, and the observed effects on variables in our instances. Extensive experiments and statistical analyses demonstrate that our proposed EM is more efficient than SA and other heuristics with regards to the objective functions considered in this paper.

show abstract

Complexity of flow shop scheduling problems with transportation constraints

Cited by 88 publications

References 13 publications

A Joint Scheduling of Production and Distribution Operations in a Flow Shop Manufacturing System

A Joint Scheduling of Production and Distribution Operations in a Flow Shop Manufacturing System

Hybrid multiobjective genetic algorithms for integrated dynamic scheduling and routing of jobs and automated-guided vehicle (AGV) in flexible manufacturing systems (FMS) environment

An electromagnetism-inspired method for a generalized flowshop problem

Contact Info

Product

Resources

About