Abstract
The open-shop scheduling problem, one of the fundamental scheduling issues, has several applications in a variety of industries. The issue is how to allocate time on a variety of machines for a number of jobs, each of which has a certain set of actions. Because every machine can only handle single operation at a time, the order in which jobs are processed on the machines has no influence on the scheduling output. The goal is to establish a schedule, or the completion times of the operations carried out by the machines, in order to optimise a performance criterion. Although the problem has been studied since the 1970s, there has been renewed interest in its computational difficulty and various solution approaches in recent years. We give an up-to-date and thorough assessment of studies on subject that concentrate on minimising the makespan, with an aim to providing a complete road map for future research on the open-shop scheduling challenge, and we suggest potential research prospects. The two-machine open shop scheduling discussed in this study takes into account distinct job blocks, setup times, and transportation times requirements in a fuzzy context. Additionally, a single agent that transports the jobs from one machine to another is taken into consideration. The goal in this paper is to reduce the machine's lifespan whenever processing time and setup time are included represented by a triangular membership function in a fuzzy environment. Since scheduling issues with makespan minimization as one of the objectives are NP-hard, precise optimization methods are not useful. A heuristic algorithm to choose the best order of jobs to process with the shortest makespan is explained. It is based on some mathematical theorems.
Keyword
Open shop scheduling, Completion times, Job blocks, Setup times, Average high ranking, Transportation times.
PDF Download (click here)
|