Loading...
Search for:
open-shop-scheduling
0.01 seconds
Applying circular coloring to open shop scheduling
, Article Scientia Iranica ; Volume 15, Issue 5 , 2008 , Pages 652-660 ; 10263098 (ISSN) ; Ghandehari, M ; Sharif University of Technology
Sharif University of Technology
2008
Abstract
In this paper, a new approach to formulate a class of scheduling problems is introduced, which can be applied to many other discrete problems with complicated structures. The concept of graph circular coloring is applied to develop a model for the special case of an open shop scheduling problem. In this problem, there are some independent jobs to be processed in a shop with dedicated renewable resources. Each job consists of several tasks with no precedence restriction. Each task is processed without preemption. The processing time of the tasks is given. Processing each task requires using some multiple specified types of resource, while no more than one task can use each resource,...
A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates
, Article Applied Soft Computing Journal ; Volume 12, Issue 4 , 2012 , Pages 1399-1416 ; 15684946 (ISSN) ; Mahdavi, I ; Mahdavi Amiri, N ; Sharif University of Technology
2012
Abstract
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...