Job-shop scheduling by combining reachability analysis with linear programming

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 37, Issue 18, 2004, Pages 195-200

  Panek, Sebastian ^a   Stursberg, Olaf ^a   Engel, Sebastian ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Automata; Optimi zation; Programming; Reachability; Scheduling

Indexed keywords

AUTOMATA THEORY; DISCRETE EVENT SIMULATION; FORESTRY; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; ROBOTS; SCHEDULING;

AUTOMATA; OPTIMIZATION PROBLEMS; PLANNING AND SCHEDULING; PROBLEM SPECIFICATION; REACHABILITY; REACHABILITY ANALYSIS; REACHABILITY TREE; SEARCH ALGORITHMS;

JOB SHOP SCHEDULING;

EID: 62549150590     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/S1474-6670(17)30745-0     Document Type: Conference Paper

References (14)

1. Abdeddaim, Y. and O Maler (2001). Job-shop scheduling using timed automata. LNCS 2102. CAY'2001. Springer, pp, 478-492, .
2. Alur, R. and DX Dill (1994). A theory of timed automata. Theor. Comp. Science 126(2), 183-235.
3. Saptiste, P., C. Le Pape and W. Nuijten (2001) Constraint-Based Scheduling: Applying Con-straint Programming to Scheduling Problems. Kluwer Acad Publisher.
4. Behrmann, G . A Fehnker, T.S. Hune, P. Petter-Son, K. Larsen and J. Romijn (2001). Efficient guiding towards cost-optimality in UPPAAL In: Proc. TACAS'Ol. pp 174-188.
5. Bruns, R (1997). Scheduling. In: Handbook of Evolutionary Comp. (T. Baeck. D.B Fogel and Z, Michalewicz, Eds ). Inst, of Physics Publ.. pp. 1-9.
6. Graf, S. M. Bozga and L Mounier (2002). If- 2 0: A validation environment for component- based real-time systems. In: Proc. CAV'02 Vol. 2404 of LNCS. Springer, pp. 343-348.
7. Groetschel, M ., Krumke, S.O and Rambau, J. Eds.) (2001). Online Optimzation of Large Scale Systems. Springer.
8. lerapetritou, M and C. Floudas (1993). Effective continuous-time formulation for short-term scheduling - multipurpose batch processes.Ind. Eng. Chem. Res. 37, 4341-4359.
9. Kallrath, J (2002). Combined strategic and operational planning - An MILP success story in chem. ind OR Spectrum 24. 315-341, .
10. Kondili, E., C.C. Pantelides and R.W.H. Sargent (1993) A general algorithm for short-term sched. of batch operations - MILP formulation. Com.p. Chem. Eng. 17. 211-227.
11. Larsen, K G., P Petterson and W. Yi (1997), Uppaal in a nutshell. Int. J. Software Tools for Techn. Transfer 1(1)- 134-152, .
12. Mamie, Alan S (1960). On the job-shop scheduling problem Oper. Res. 8(2). 219-223.
13. Panek, S., O Stursberg and S Engell (2004). Op- Tim of timed automata models using mixed- integer programming. In: Pormal Mod. And Analysis of Tim.ed Sys.. Vol. 2791 of LNCS. Springer, pp. 73-77.
14. Yovme, S. (1998). Model checking timed automata. In: Embedded Systems. Vol. 1494 of LNCS. Springer, pp. 114-152.