job shop
Recently Published Documents


TOTAL DOCUMENTS

5045
(FIVE YEARS 965)

H-INDEX

102
(FIVE YEARS 12)

Author(s):  
Vivek Vishnu ◽  
◽  
Vineet Kumar Dwivedi ◽  

The thesis proposes a method for introducing lean manufacturing using string diagram in an operating CNG high pressure storage tank manufacturing job shop at Jayfe Cylinder Ltd. Haryana. By applying lean manufacturing using process layout diagram to produce part families with similar manufacturing processes and stable demand, plants expect to reduce costs and lead-times and improve quality and delivery performance. The thesis outlines a method for assessing, designing, and implementing lean manufacturing using process layout diagram, and illustrates this process with an example. A manufacturing cell that produces high pressure steel tank container for commercial & automobile customers is implemented at cylinder tank Machining Centers. The conclusion of the thesis highlights the key lessons learned from this process.


2022 ◽  
pp. 1-14
Author(s):  
Hui Yu ◽  
Jun-qing Li ◽  
Xiao-Long Chen ◽  
Wei-meng Zhang

 During recent years, the outpatient scheduling problem has attracted much attention from both academic and medical fields. This paper considers the outpatient scheduling problem as an extension of the flexible job shop scheduling problem (FJSP), where each patient is considered as one job. Two realistic constraints, i.e., switching and preparation times of patients are considered simultaneously. To solve the outpatient scheduling problem, a hybrid imperialist competitive algorithm (HICA) is proposed. In the proposed algorithm, first, the mutation strategy with different mutation probabilities is utilized to generate feasible and efficient solutions. Then, the diversified assimilation strategy is developed. The enhanced global search heuristic, which includes the simulated annealing (SA) algorithm and estimation of distribution algorithm (EDA), is adopted in the assimilation strategy to improve the global search ability of the algorithm.?Moreover, four kinds of neighborhood search strategies are introduced to?generate new?promising?solutions.?Finally, the empires invasion strategy?is?proposed to?increase the diversity of the population. To verify the performance of the proposed HICA, four efficient algorithms, including imperialist competitive algorithm, improved genetic algorithm, EDA, and modified artificial immune algorithm, are selected for detailed comparisons. The simulation results confirm that the proposed algorithm can solve the outpatient scheduling problem with high efficiency.


2022 ◽  
Vol 2022 ◽  
pp. 1-13
Author(s):  
Jiamin Zhang ◽  
Jiarui Zhang

Trains can be optimally spread over the period of the cyclic timetable. By integrating sequencing issue with headway time together, this paper studies the structure optimization of mixed-speed train traffic for a cyclic timetable. Firstly, by taking it as a job-shop problem with sequence-dependent setup times on one machine, in the type of infinite capacity resource with headway (ICR + H), the problem is transformed to alternative graph (AG) and then recast to the mixed-speed train traffic planning (MSTTP) model. For the multiobjective in MSTTP, three indicators are optimized, i.e., heterogeneity, cycle time, and buffer time, which correspond to diversity of train service toward passenger, capacity consumption of rail network, and stability of train operation, respectively. Secondly, the random-key genetic algorithm (RKGA) is proposed to tackle the sequence and headway simultaneously. Finally, RKGA is coded with visual studio C# and the proposed method is validated with a case study. The rail system considered is a line section encompassing a territory of 180 km with 15 mixed-speed trains in each cycle of the timetable. Results indicate the comprehensively balanced train plan for all stakeholders from random variations of train sequence and headway time. Both the quantitative proportion of heterogeneity/homogeneity (e.g., 2.5) about the optimized distribution of the mixed train traffic and the link between train headway time and the sequence for each traffic scenario are found. All the findings can be used to arrange the mixed-speed train traffic more scientifically.


Author(s):  
Stefan Haeussler ◽  
Philipp Neuner ◽  
Matthias Thürer

AbstractMost Workload Control literature assumes that delivery performance is determined by tardiness related performance measures only. While this may be true for companies that directly deliver to end-customers, for make-to-stock companies or firms that are part of supply chains, producing early often means large inventories in the finished goods warehouse or penalties incurred by companies downstream in the supply chain. Some earlier Workload Control studies used a so-called time limit, which constrains the set of jobs that can be considered for order release, to reduce earliness. However, recent literature largely abandoned the time limit since it negatively impacts tardiness performance. This study revisits the time limit, assessing the use of different adaptive policies that restrict its use to periods of either low or high load. By using a simulation model of a pure job shop, the study shows that an adaptive policy allows to balance the contradictory objectives of delaying the release of orders to reduce earliness and to release orders early to respond to periods of high load as quick as possible. Meanwhile, only using a time limit in periods of high load was found to be the best policy.


Sign in / Sign up

Export Citation Format

Share Document