Henrik Heitmann - Selected Scheduling Applications

79,80 €
79,80 €
inkl. MwSt.
zzgl. Versandkosten

Lieferzeit max. 3 Tage *

Die Menge muss 1 oder mehr sein

Lieferung & Versand

  • Warensendung bis 500 g
    0,00 €
    Lieferzeit max. 3 Tage

Über das Buch

– in englischer Sprache –

Zum Inhalt

The first chapter is dedicated to a general introduction into scheduling. Among the basic concepts in scheduling, machine scheduling, general methodologies for solving scheduling problems, scheduling formulations and definitions in computational complexity are illustrated. The first chapter ends with a brief synopsis.

In chapter 2, the yard crane scheduling and routing problem is addressed. More precisely, it is focussed on the job scheduling and crane routing of automated rail-mounted-gantry cranes of storage yards on seaport container terminals. The chapter starts with a brief introduction on seaport container terminals, container flows, terminal operations and the central container storage as well as the regarded twin, double and triple rail-mounted-gantrycrane systems. This is followed by a specification of the yard-crane scheduling and routing problem with respect to the problem decisions which are to be made. Afterwards, a survey of the relevant literature is given. Then mixed-integer programmes, which are based on time-indexed variables, are formulated for the yard-crane scheduling and routing problem for each system. To handle large scale scheduling and routing problem instances, a solution method is developed which is based on a problem decomposition.

Therefore, the whole problem is divided into the scheduling and routing problem which are solved consecutively such that the result of the scheduling problemthe job assignment and sequencing?are used for the calculation of the routing problem. Both methods, the mixed-integer programme and the solution method are analysed numerically on typical problem instances for each crane system. It is found that solving the mixed-integer programmes by commercial solvers are outperformed by the solution method. But even solving the routing problems may lead to long solution times.

In chapter 3, the crane-routing problems for the twin and double railmounted- gantry-crane systems are…

Schlagworte

Scheduling, Yard-Crime Scheduling and Routing, Movie Scheduling, Students Scheduling, Computational Complexity, Machine Scheduling, Timetabling, Rostering, Mixed-Integer Programming, Operations Research, Ablaufplanung, Betriebswirtschaftslehre

  • Autor*in
    Henrik Heitmann
  • Seiten
    176
  • Zusatzinfos
    – in englischer Sprache –
  • Jahr
    Hamburg 2015
  • ISBN
    978-3-8300-8239-2
  • Fachdisziplin
    Marketing & Absatz
  • Schriftenreihe
    QM – Quantitative Methoden in Forschung und Praxis
  • ISSN
    1610-0735
  • Band
    38
  • Fachbereich
    Wirtschaft

Lieferzeit

(*) Die Lieferzeit beträgt innerhalb Deutschlands üblicherweise 2 bis 3 Werktage ab Zahlungseingang. Bei Bestellungen an Wochenenden und Feiertagen verzögert sich die Auslieferung entsprechend.