Abstract
Single machine models are an important kind of scheduling models. In this paper, we assume that each of the processing time, the release time and the due date of a single machine model may be fuzzy. For jobs scheduled in a single machine environment, the Earliest Due Date (EDD) rule serves to minimize the maximum lateness among the jobs waiting for processing. A fuzzy EDD algorithm is proposed to manage the scheduling uncertainty. This algorithm yields a scheduling result with a final fuzzy completion time and a fuzzy maximum lateness. Our objective is to find a near optimal schedule and the minimization of the maximum lateness under uncertainty. We are hopeful that the algorithm may help managers to gainxsa broader view of scheduling.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
