Giffler and Thompson's Algorithm for Job Shop Scheduling is Still Good for Flexible Manufacturing Systems

1993 ◽  
Vol 44 (5) ◽  
pp. 521 ◽  
Author(s):  
Mario A. Nascimento
Keyword(s):  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Shop Scheduling ◽  
Good For

Scheduling in Flexible Manufacturing Systems

2018 ◽  
pp. 1-19
Author(s):  
Fraj Naifar ◽  
Mariem Gzara ◽  
Taicir Loukil Moalla
Keyword(s):  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Computation Time ◽  
Flexible Job Shop ◽  
Scheduling Problems ◽  
Genetic Operators ◽  
Flexible Job Shop Problem

Flexible manufacturing systems have many advantages like adaptation to changes and reduction of lateness. But flexible machines are expensive. The scheduling is a central functionality in manufacturing systems. Optimizing the job routing through the system, while taking advantage from the flexibility of the machines, aims at improving the system's profitability. The introduction of the flexibility defines a variant of the scheduling problems known as flexible job shop scheduling. This variant is more difficult than the classical job shop since two sub-problems are to be solved the assignment and the routing. To guarantee the generation of efficient schedules in reasonable computation time, the metaheuristic approach is largely explored. Particularly, much research has addressed the resolution of the flexible job shop problem by genetic algorithms. This chapter presents the different adaptations of the genetic scheme to the flexible job shop problem. The solution encodings and the genetic operators are presented and illustrated by examples.

scholarly journals Impact of Personnel Flexibility on Job Shop Scheduling

2016 ◽  
Vol 2016 ◽  
pp. 1-8 ◽  
Author(s):  
Ren Lin ◽  
Guohua Zhou ◽  
Aijun Liu ◽  
Hui Lu ◽  
Tonglei Li
Keyword(s):  
Flexible Manufacturing ◽  
Manufacturing Systems ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Case Analysis ◽  
Quantitative Relationship ◽  
Improved Genetic Algorithm ◽  
Shop Scheduling ◽  
Scheduling Model ◽  
The Relationship

Considering the lack of the research on the relationship between HR flexibility and scheduling effect, a resource-competency matrix-based method was proposed in order to reveal the quantitative relationship between them. Meanwhile, a job shop scheduling model with HR flexibility was established and the improved genetic algorithm was used to solve the model. A case analysis demonstrated significant impact of HR flexibility on the scheduling effect, which provided valuable guidance for building flexible manufacturing systems.

scholarly journals Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

2020 ◽  
Author(s):  
Moussa Abderrahim ◽  
Abdelghani Bekrar ◽  
Damien Trentesaux ◽  
Nassima Aissani ◽  
Karim Bouamrane
Keyword(s):  
Manufacturing Systems ◽  
Variable Neighborhood Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Efficient Production ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

AbstractIn job-shop manufacturing systems, an efficient production schedule acts to reduce unnecessary costs and better manage resources. For the same purposes, modern manufacturing cells, in compliance with industry 4.0 concepts, use material handling systems in order to allow more control on the transport tasks. In this paper, a job-shop scheduling problem in vehicle based manufacturing facility that is mainly related to job assignment to resources is addressed. The considered job-shop production cell has two types of resources: processing resources that accomplish fabrication tasks for specific products, and transporting resources that assure parts’ transport to the processing area. A Variable Neighborhood Search algorithm is used to schedule product manufacturing and handling tasks in the aim to minimize the maximum completion time of a job set and an improved lower bound with new calculation method is presented. Experimental tests are conducted to evaluate the efficiency of the proposed approach.

scholarly journals Job-shop Scheduling Over a Heterogeneous Platform

2021 ◽  
Vol 16 (3) ◽  
Author(s):  
Hector Benitez-Perez ◽  
Jose A. Hermosillo-Gomez
Keyword(s):  
Embedded System ◽  
Manufacturing Systems ◽  
Production Efficiency ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Human Interaction ◽  
Periodic Tasks ◽  
Real Time Scheduling ◽  
Shop Scheduling ◽  
Heterogeneous Platform

Real-time scheduling involves determining the allocation of platform resources in such a way tasks can meet their temporal restrictions. This work focuses on job-shop tasks model in which a task have a finite number of nonpreemptive different instances (jobs) that share a unique hard deadline and their time requirements are known until task arrival. Non-preemptive scheduling is considered because this characteristic is widely used in industry. Besides job-shop scheduling has direct impacts on the production efficiency and costs of manufacturing systems. So that the development of analysis for tasks with these characteristics is necessary. The aim of this work is to propose an online scheduling test able to guarantee the execution of a new arriving task, which is generated by human interaction with an embedded system, otherwise to discart it. An extension of the schedulability test proposed by Baruah in 2006 for non-preemptive periodic tasks over an identical platform is presented in this paper. Such extension is applied to non-preemptive tasks that have hard deadlines over a heterogeneous platform. To do that, some virtual changes over both the task set and the platform are effectuated.

Sign in / Sign up

Export Citation Format

Share Document