A New Mathematical Model for Hybrid Flow Shop Under Time-Varying Resource and Exact Time-Lag Constraints

2021 ◽  
pp. 87-99
Author(s):  
Quoc Nhat Han Tran ◽  
Nhan Quy Nguyen ◽  
Hicham Chehade ◽  
Farouk Yalaoui ◽  
Frédéric Dugardin
2016 ◽  
Vol 50 (2) ◽  
pp. 223-232 ◽  
Author(s):  
Karim Amrouche ◽  
Mourad Boudhar
Keyword(s):  
Time Lag ◽  

Author(s):  
Adel Mendoza-Mendoza ◽  
Wilfrido Ospino-Castro ◽  
Daniela Romero-Martínez

This paper proposes a mathematical model for production scheduling, whose objective is to maximize the profits or Throughput of a company in the food sector through a Flexible Hybrid Flow, based on the theory of constraints. Considering the company's production configuration, which is a two-stage hybrid flow line, a mixed integer linear model programming (MILP) was formulated and programmed to adequately represent the real situation. The mathematical model developed in this study that is an easy and effective tool that helps to control the production process, by optimizing the quantities of each product to be produced, as well as establishing the sequence in which they must be carried out, which becomes an advantage against its competitors and also obtain a timely response to the needs of demand and compliance with the commitments made to its customers. The results obtained with the MILP, with reasonable computational times, allow for maximizing profits, considering the constraints of the problem.


Author(s):  
Jingcao Cai ◽  
Deming Lei

AbstractDistributed hybrid flow shop scheduling problem (DHFSP) has attracted some attention; however, DHFSP with uncertainty and energy-related element is seldom studied. In this paper, distributed energy-efficient hybrid flow shop scheduling problem (DEHFSP) with fuzzy processing time is considered and a cooperated shuffled frog-leaping algorithm (CSFLA) is presented to optimize fuzzy makespan, total agreement index and fuzzy total energy consumption simultaneously. Iterated greedy, variable neighborhood search and global search are designed using problem-related features; memeplex evaluation based on three quality indices is presented, an effective cooperation process between the best memeplex and the worst memeplex is developed according to evaluation results and performed by exchanging search times and search ability, and an adaptive population shuffling is adopted to improve search efficiency. Extensive experiments are conducted and the computational results validate that CSFLA has promising advantages on solving the considered DEHFSP.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 223782-223796
Author(s):  
Xixing Li ◽  
Hongtao Tang ◽  
Zhipeng Yang ◽  
Rui Wu ◽  
Yabo Luo

2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.


Sign in / Sign up

Export Citation Format

Share Document