scholarly journals Flexible Job Shop Scheduling Problem with Sequence Dependent Setup Time and Job Splitting: Hospital Catering Case Study

2021 ◽  
Vol 11 (4) ◽  
pp. 1504
Author(s):  
Fatima Abderrabi ◽  
Matthieu Godichaud ◽  
Alice Yalaoui ◽  
Farouk Yalaoui ◽  
Lionel Amodeo ◽  
...  
Keyword(s):  
Production System ◽  
Production Scheduling ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Setup Time ◽  
Flexible Job Shop ◽  
Process Scheduling ◽  
Multi Stage ◽  
Job Splitting ◽  
Decision Support Models

This paper aims to study a real case of an optimization problem derived from a hospital supply chain. The present work focuses on developing operational decision support models and algorithms for production process scheduling in hospital catering. The addressed production system is considered as a flexible job shop system. The objective is to minimize the total flow time. A novel mathematical model and two metaheuristics for the production scheduling of multi-product and multi-stage food processes are developed. These methods have proven their effectiveness for the scheduling of operations of the food production processes and allowed significant improvements in the performance of the studied production system.

Minimizing Makespan in Job Shop Scheduling Problem Using Genetic Algorithm

2015 ◽  
Vol 813-814 ◽  
pp. 1183-1187 ◽  
Author(s):  
Aathi Muthiah ◽  
R. Rajkumar ◽  
B. Muthukumar
Keyword(s):  
Genetic Algorithm ◽  
Production Scheduling ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Setup Time ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Knowing That ◽  
Batch Sizes

- Scheduling is an important tool for manufacturing and engineering, where it can have a major impact on the productivity of a process. In manufacturing, the purpose of scheduling is to minimize the production time and costs. Production scheduling aims to maximize the efficiency of the operation and reduce costs. We keep all of our machines well-maintained to prevent any problems, but there is on way to completely prevent down-time. With redundant machines we have the security of knowing that we are not going to be in trouble meeting our deadlines if a machine has any unexpected down-times. Finally we can work to get our batch sizes as small as is reasonably possible while also reducing the setup time of each batch. This allows us to eliminate a sizable portion of each part waiting while the rest of the parts in the batch are being machined.

scholarly journals An effective approach for the dual-resource flexible job shop scheduling problem considering loading and unloading

2020 ◽  
Author(s):  
Xiuli Wu ◽  
Junjian Peng ◽  
Xiao Xiao ◽  
Shaomin Wu
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Setup Time ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Loading And Unloading ◽  
Unloading Time

AbstractMany manufacturing systems need more than one type of resource to co-work with. Commonly studied flexible job shop scheduling problems merely consider the main resource such as machines and ignore the impact of other types of resource. As a result, scheduling solutions may not put into practice. This paper therefore studies the dual resource constrained flexible job shop scheduling problem when loading and unloading time (DRFJSP-LU) of the fixtures is considered. It formulates a multi-objective mathematical model to jointly minimize the makespan and the total setup time. Considering the influence of resource requirement similarity among different operations, we propose a similarity-based scheduling algorithm for setup-time reduction (SSA4STR) and then an improved non-dominated sorting genetic algorithm II (NSGA-II) to optimize the DRFJSP-LU. Experimental results show that the SSA4STR can effectively reduce the loading and unloading time of fixtures while ensuring a level of makespan. The experiments also verify that the scheduling solution with multiple resources has a greater guiding effect on production than the scheduling result with a single resource.

scholarly journals Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production

2007 ◽  
Vol 2 (2) ◽  
pp. 174 ◽  
Author(s):  
Noureddine Liouane ◽  
Ihsen Saad ◽  
Slim Hammadi ◽  
Pierre Borne
Keyword(s):  
Local Search ◽  
Production System ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Time ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Ant System ◽  
Shop Scheduling ◽  
Problem Instances

The problem of efficiently scheduling production jobs on several machines is an important consideration when attempting to make effective use of a multimachines system such as a flexible job shop scheduling production system (FJSP). In most of its practical formulations, the FJSP is known to be NP-hard [8][9], so exact solution methods are unfeasible for most problem instances and heuristic approaches must therefore be employed to find good solutions with reasonable search time. In this paper, two closely related approaches to the resolution of the flexible job shop scheduling production system are described. These approaches combine the Ant system optimisation meta-heuristic (AS) with local search methods, including tabu search. The efficiency of the developed method is compared with others.

scholarly journals Partial flexible job shop scheduling considering preventive maintenance and priorities

2020 ◽  
Vol 11 (2) ◽  
pp. 27
Author(s):  
Ameneh Farahani ◽  
Hamid Tohidi ◽  
Mehran Khalaj ◽  
Ahmad Shoja
Keyword(s):  
Preventive Maintenance ◽  
Production Scheduling ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Programming Model ◽  
Model Parameters ◽  
Flexible Job Shop ◽  
Scheduling Problems ◽  
Flexible Job Shop Scheduling ◽  
Shop Scheduling

<p>In this paper, a new mathematical programming model is proposed for a partial flexible job shop scheduling problem with an integrated solution approach. The purpose of this model is the assignment of production operations to machines with the goal of simultaneously minimizing operating costs and penalties. These penalties include delayed delivery, deviation from a fixed time point for preventive maintenance, and deviation from the priorities of each machine. Considering the priorities for machines in partial flexible job shop scheduling problems can be a contribution in closer to the reality of production systems. For validation and evaluation of the effectiveness of the model, several numerical examples are solved by using the Baron solver in GAMS. Sensitivity analysis is performed for the model parameters. The results further indicate the relationship between scheduling according to priorities of each machine and production scheduling.</p><p><em><br /></em></p><p><em><br /></em></p>

Sign in / Sign up

Export Citation Format

Share Document