Loading...
Search for: single-process
0.043 seconds

    Applying circular coloring to open shop scheduling

    , Article Scientia Iranica ; Volume 15, Issue 5 , 2008 , Pages 652-660 ; 10263098 (ISSN) Modarres, M ; 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,...