An open shop scheduling problem with fuzzy allowable time and fuzzy resource constraint

doi:10.1016/S0165-0114(97)00380-1

Fuzzy Sets and Systems

Volume 109, Issue 1, 1 January 2000, Pages 141-147

https://doi.org/10.1016/S0165-0114(97)00380-1 Get rights and content

Abstract

A model for a preemptive open shop scheduling problem is presented and constraints due to fuzzy resource and allowable time are introduced. This problem is a fuzzy version of the model by Werra et al. and has bi-criteria to be maximized, i.e., minimal satisfaction degree with respect to the processing intervals of jobs and, minimal satisfaction degree of resource amounts used in the processing intervals. We present an efficient algorithm for this problem.

References (0)

Cited by (24)

A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates
2012, Applied Soft Computing Journal
Citation Excerpt :
After use of appropriate strategies to convert this possibilistic model into an auxiliary crisp multi-objective linear programming model (MOLP), they proposed a novel interactive fuzzy programming approach to solve this MOLP and obtain a preferred compromise solution. Konno and Ishii [19] designed a preemptive open shop scheduling problem with fuzzy resource and allowable time. This problem considers two criteria for maximization, i.e., minimal satisfaction degree with respect to the processing intervals of jobs, and minimal satisfaction degree of resource amounts used in the processing intervals.
We are concerned with an open shop scheduling problem having sequence-dependent setup times. A novel bi-objective possibilistic mixed-integer linear programming model is presented. Sequence-dependent setup times, fuzzy processing times and fuzzy due dates with triangular possibility distributions are the main constraints of this model. An open shop scheduling problem with these considerations is close to the real production scheduling conditions. The objective functions are to minimize total weighted tardiness and total weighted completion times. To solve small-sized instances for Pareto-optimal solutions, an interactive fuzzy multi-objective decision making (FMODM) approach, called TH method proposed by Torabi and Hassini, is applied. Using this method, an equivalent auxiliary single-objective crisp model is obtained and solved optimally by the Lingo software. For medium to large size examples, a multi-objective particle swarm optimization (MOPSO) algorithm is proposed. This algorithm consists of a decoding procedure using a permutation list to reduce the search area in the solution space. Also, a local search algorithm is applied to generate good initial particle positions. Finally, to evaluate the effectiveness of the MOPSO algorithm, the results are compared with the ones obtained by the well-known SPEA-II, using design of experiments (DOE) based on some performance metrics.
A fuzzy-mixed-integer goal programming model for a parallel-machine scheduling problem with sequence-dependent setup times and release dates
2009, Robotics and Computer-Integrated Manufacturing
This paper presents a new mixed-integer goal programming (MIGP) model for a parallel-machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the complexity of the above model and uncertainty involved in real-world scheduling problems, it is sometimes unrealistic or even impossible to acquire exact input data. Hence, we consider the parallel-machine scheduling problem with sequence-dependent set-up times under the hypothesis of fuzzy processing time's knowledge and two fuzzy objectives as the MIGP model. In addition, a quite effective and applicable methodology for solving the above fuzzy model are presented. At the end, the effectiveness of the proposed model and the denoted methodology is demonstrated through some test problems.
Heuristics for scheduling in a no-wait open shop with movable dedicated machines
2008, International Journal of Production Economics
In this paper, we address a scheduling problem related to people's livelihood, such as road construction works that include laying pipes for gas, water and phone. The problem is a multi-processing-stage open shop with the characteristics of movable dedicated machines and no-wait restriction, also known as no intermediate queue. The objective is to schedule the jobs such that the total occupation time for all the processing stages is minimized. Some two-phase heuristic algorithms are proposed for solving the problem. Computational results show that the heuristic is fairly effective in finding an optimal or a near-optimal solution for small-sized problems. Results of the heuristic for experiments tallied with the real-life environment demonstrate the potential of the heuristic to efficiently deal with the scheduling problems.
Parallel machine scheduling models with fuzzy processing times
2004, Information Sciences
A fuzzy robust scheduling approach for product development projects
2004, European Journal of Operational Research
Efficient scheduling of a product development project is difficult, since a development project is usually unique in nature and high level of design imprecision exists at the early stages of product development. Moreover, risk-averse project managers are often more interested in estimating the risk of a schedule being late over all potential realizations. The objective of this research is to develop a robust scheduling methodology based on fuzzy set theory for uncertain product development projects. The imprecise temporal parameters involved in the project are represented by fuzzy sets. A measure of schedule robustness based on qualitative possibility theory is proposed to guide the search process to determine the robust schedule; i.e., the schedule with the best worst-case performance. A genetic algorithm approach is developed for solving the problem with acceptable performance. An example of electronic product development project is used to illustrate the concept developed.
An Efficient Parallel Greedy Algorithm for Fuzzy Hybrid Flow Shop Scheduling with Setup Time and Lot Size: A Case Study in Apparel Process
2022, Journal of Fuzzy Extension and Applications

View all citing articles on Scopus

View full text