Transformation of the cyclic scheduling problem of a large class of FMS into the search of an optimized initial marking of a linearizable weighted T-system

Trouillet, Benoit; Benasser, Ahmer; Gentina, J.C.

doi:10.1109/wodes.2002.1167673

Cited by 7 publications

(7 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The production lines of manufacturing system often include assembly/disassembly tasks. This can be accounted for the nature of the aimed output, which requires to assemble and/or disassemble several parts ( [13], [17], [18], [19], [20], [21]). There are also many systems with only disassembly tasks, for example disassembly lines used in recycling ( [8], [10], [15]).…”

Section: A Systems With Assembly/disassembly Tasksmentioning

confidence: 99%

See 1 more Smart Citation

A Mathematical Model for Cyclic Scheduling with Assembly Tasks and Work-In-Process Minimization

Amar

Camus

Korbaa

2010

Frontiers of Assembly and Manufacturing

View full text Add to dashboard Cite

In this paper, we deal with the cyclic scheduling problem. More precisely, we consider the cyclic job shop with assembly tasks. Such a problem is made of several jobs, each job consisting of tasks (assembly/disassembly tasks and transformation tasks) being assigned to machines in a cyclic way. This kind of scheduling problem is well fitted to medium and large production demands, since the cyclic behavior can avoid the scheduling of the whole tasks by considering only a small temporal window (cycle). Thus, cyclic scheduling is a heuristic to solve the scheduling problems whose complexity is NP-hard in the general case. Many methods have been proposed to solve the cyclic scheduling problem. Among them, we focus on the mathematical programming approach. We will propose here a mathematical model for cyclic scheduling with assembly tasks and Work-In-Process minimization, and we illustrate this approach with an example from literature.

show abstract

Section: A Systems With Assembly/disassembly Tasksmentioning

confidence: 99%

“…Another point of view concerning the definition of the WIP is proposed by Trouillet [19]. He considers that the WIP in a system is equal to the maximum number of parts present in a cyclic window.…”

Section: Work-in-processmentioning

confidence: 99%

A Mathematical Model for Cyclic Scheduling with Assembly Tasks and Work-In-Process Minimization

Amar

Camus

Korbaa

2010

Frontiers of Assembly and Manufacturing

View full text Add to dashboard Cite

show abstract

“…This is led by the nature of the aimed output, which requires to assemble and/or disassemble several parts. Many authors are interested by this field of production system (Mascle (2001), Sundaram (2001), Jianzhong (2002), Trouillet (2002), Trouillet (2006), Trouillet (2007), Ben Amar (2009). More precisely, Mascle, Sundaram and Jianzhong aim to find or optimize the assembly/disassembly sequences.…”

Section: Cyclic Systems With Assembly/disassembly Tasksmentioning

confidence: 99%

Formalization of Cyclic Scheduling Problems With Assembly Tasks and Work-In-Process Minimization

Amar¹,

Camus

Korbaa

2010

Electronic Workshops in Computing

View full text Add to dashboard Cite

We consider the scheduling problem of cyclic job shop with assembly/disassembly tasks. Such a problem is made of several jobs, each job consisting of tasks (assembly/disassembly tasks and transformation tasks) being assigned to machines in a cyclic way. Many methods have been proposed to solve the cyclic scheduling problem. Among them, we focus on the mathematical programming approach. We will propose here an improvement of an existing mathematical model for cyclic scheduling with assembly tasks and Work-In-Process minimization.

show abstract

“…tokens) have to be stored or to be moved from one buffer to another. Cyclic production systems with batch scheduling, the assembling of products or buffers of limited capacity may easily be considered using this formalism [8], [9].…”

Section: Introductionmentioning

confidence: 99%

Periodic Schedules for Bounded Timed Weighted Event Graphs

Benabid-Najjar

Hanen

Marchetti

et al. 2012

IEEE Trans. Automat. Contr.

View full text Add to dashboard Cite

Timed event graphs (TEGs) and timed weighted event graphs (TWEGs) which have multiple arc cardinalities, have been widely used for automated production systems such as robotized work cells or embedded systems. TWEGs are useful for modeling batch flows of entities such as batch arrivals or processing of jobs. Periodic schedules, that combine an explicit description of starting times and an easy implementation are particularly interesting, and have been proved to be optimal for ordinary timed event graphs (TEGs). In this paper, we present polynomial algorithms to check the existence of periodic schedules of bounded TWEGs and to compute their optimal throughput. These results can be considered as generalizations of those for ordinary timed event graphs. We then establish that periodic schedules are suboptimal for TWEGs and may not exist even for a live TWEG. The gap between optimal throughput and throughput of an optimal periodic schedule is experimentally investigated for a subclass of TWEGs, namely timed weighted circuits.

show abstract

Transformation of the cyclic scheduling problem of a large class of FMS into the search of an optimized initial marking of a linearizable weighted T-system

Cited by 7 publications

References 11 publications

A Mathematical Model for Cyclic Scheduling with Assembly Tasks and Work-In-Process Minimization

A Mathematical Model for Cyclic Scheduling with Assembly Tasks and Work-In-Process Minimization

Formalization of Cyclic Scheduling Problems With Assembly Tasks and Work-In-Process Minimization

Periodic Schedules for Bounded Timed Weighted Event Graphs

Contact Info

Product

Resources

About