availability constraint
در نشریات گروه صنایع-
International Journal of Supply and Operations Management, Volume:10 Issue: 3, Summer 2023, PP 319 -336Nowadays, in production environments where the production system is parallel machines, the reliability of the machines is important and the uncertainty of scheduling parameters is common. In this paper, unrelated parallel machine scheduling problem using a fuzzy approach with machines maintenance activities and process constraints is of concern. An important application of this problem is in the production of products that the due dates are defined as a time window and the best due date is close to the middle of the time window and the jobs processing times depend on other factors such as operator and their value is not specified and are announced as interval under uncertainty. In this study, first, a fuzzy mathematical model is proposed in which changing between a fuzzy approach and a deterministic model is described. Then, since the problem is NP-hard, a fuzzy-based genetic algorithm to solve large instances is developed. In this algorithm, a greedy decoding approach according to fuzzy parameters is developed. Numerical experiments are used to evaluate the performance of the developed algorithm. It is concluded that the proposed algorithm shows great performance in large instances and is superior to the proposed mathematical model in small instances too.Keywords: parallel-machine scheduling, fuzzy processing times, fuzzy due dates, availability constraint, Genetic Algorithm
-
International Journal of Industrial Engineering and Productional Research, Volume:30 Issue: 3, Sep 2019, PP 329 -340
Sequence dependent set-up times scheduling problems (SDSTs), availability constraint and transportation times are interesting and important issues in production management, which are often addressed separately. In this paper, the SDSTs job shop scheduling problem with position-based learning effects, job-dependent transportation times and multiple preventive maintenance activities is studied. Due to learning effects, jobs processing times are not fixed during plan horizon and each machine has predetermined number of preventive maintenance activities. A novel mixed integer linear programming model is proposed to formulate the problem for minimizing Make Span. Owing to the high complexity of the problem; we applied Grey Wolf Optimizer (GWO) and Invasive Weed Optimizer (IWO) to find nearly optimal solutions for medium and large instances. Finally, the computational Results are provided for evaluating the performance and effectiveness of the proposed solution approaches.
Keywords: Sequence dependent set-up times, job shop scheduling, learning effects, Availability constraint, Transportation times -
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The investigated models are very close to the actual scheduling problems, because they envisage the flexible job shop environments, heads, set-up times, arbitrary number of unavailability periods on all resources, arbitrary number of work-centers, any kind of cross-ability, any kind of resume-ability and several types of performance measures. The proposed model is presented to solve two-job problems because it is a graphical approach. However, it is concluded that the idea can be extended to n-dimensional problems as well.
Keywords: Flexible job shop scheduling, Resumeable operations, Akers` graphical algorithm, availability constraint
- نتایج بر اساس تاریخ انتشار مرتب شدهاند.
- کلیدواژه مورد نظر شما تنها در فیلد کلیدواژگان مقالات جستجو شدهاست. به منظور حذف نتایج غیر مرتبط، جستجو تنها در مقالات مجلاتی انجام شده که با مجله ماخذ هم موضوع هستند.
- در صورتی که میخواهید جستجو را در همه موضوعات و با شرایط دیگر تکرار کنید به صفحه جستجوی پیشرفته مجلات مراجعه کنید.