CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Scheduling model for systems with complex alternative behaviour

Oskar Wigström (Institutionen för signaler och system, Automation) ; Bengt Lennartson (Institutionen för signaler och system, Automation)
2012 IEEE Conference on Automation Science and Engineering, CASE 2012 (2161-8070). p. 587-593. (2012)
[Konferensbidrag, refereegranskat]

In this paper we propose a flexible model for scheduling problems, which allows the modeling of systems with complex alternative behaviour. This model could for example facilitate the step from process planning model to optimization model. We show how automatic constraint generation can be performed for both Constraint Programming and Mixed Integer Linear Programming (MILP) models. Also, for the MILP case, a new formulation for mutual exclusion of resources is proposed. This new formulation works well for proving optimality in systems with multiple capacity resources. Some benchmarks for such job shop scheduling problems as well as systems with a large number of alternatives are also presented.

Nyckelord: Optimal scheduling , Resource management



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-01-03. Senast ändrad 2013-05-07.
CPL Pubid: 169038

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)