Search published articles


Showing 2 results for Flowshop

Rashed Sahraeian,
Volume 25, Issue 1 (2-2014)
Abstract

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the machines of stage one in serial batch is the main contribution of this study. Machine set-up and ready time for all jobs are assumed to be zero and no Preemption is allowed. Machines may not breakdown but at times they may be idle. As the problem is NP-hard, a genetic algorithm is developed to give near optimal solutions. Since this problem has not been studied previously, therefore, a lower bound is developed for evaluating the performance of the proposed GA. Many test problems have been solved using GA and results compared with lower bound. Results showed GA can obtain a near optimal solution for small, median and large size problems in reasonable time.
Yuri Delano Regent Montororing,
Volume 35, Issue 3 (9-2024)
Abstract

Technological advancements have fueled heightened competition in manufacturing, compelling companies to adopt strategies prioritizing swift, timely, and high-quality customer service. This necessitates seamless integration of supportive systems such as resources, equipment, facilities, and workforce, underscoring the criticality of scheduling in aligning activities and resources for on-time task completion. Scheduling, inseparable from sequencing, is pivotal in optimizing manufacturing and service industries' operations. However, challenges arise when tasks converge with limited facility capacities, necessitating effective resource allocation. By leveraging mathematical techniques and heuristic methods, scheduling optimizes resource utilization, minimizes production costs, and enhances service quality. Despite its significance, existing models often overlook critical aspects like identical job consideration and sequence-dependent setup times, limiting real-world applicability. This research addresses these gaps by proposing robust mathematical models for intricate scheduling requirements. The proposed approach seeks to optimize manufacturing operations by effectively handling complex scheduling needs, thereby minimizing production costs and enhancing operational efficiency. This research endeavours to advance scheduling optimization strategies through real-world implementation and evaluation and contribute to the manufacturing industry's sustainable growth.


Page 1 from 1