Arbeitspapier

Project scheduling with processing time compression cost and lateness penalties

zu Verbundenen Objekten

We consider a project scheduling problem where the precedence constraints graph is an out-tree. The processing times can be compressed by using additional resources, which causes cost and simultaneously reduces the processing times of jobs. The objective is to minimize the sum of total lateness penalties and total compression costs where the cost function for compressing the processing times is linear in the amount of compression. The problem can be decomposed into two types of subproblems. We show that both subproblems can be solved in polynomial time. Using these results, we show that the main problem is solvable in polynomial time if the number of chains in the out-tree is fixed.

Sprache
Englisch

Erschienen in
Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; No. 651

Klassifikation
Management
Thema
Project scheduling
controllable processing times
convex programming
shortest path problem
Projektmanagement
Scheduling-Verfahren
Netzplantechnik

Ereignis
Geistige Schöpfung
(wer)
Choi, Byung-Cheon
Briskorn, Dirk
Ereignis
Veröffentlichung
(wer)
Universität Kiel, Institut für Betriebswirtschaftslehre
(wo)
Kiel
(wann)
2010

Handle
Letzte Aktualisierung
10.03.2025, 11:44 MEZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Original beim Datenpartner anzeigen

Objekttyp

  • Arbeitspapier

Beteiligte

  • Choi, Byung-Cheon
  • Briskorn, Dirk
  • Universität Kiel, Institut für Betriebswirtschaftslehre

Entstanden

  • 2010

Ähnliche Objekte (12)

Penalties

Abschnitt

Penalties

Project management and project scheduling

Project management and project scheduling

The resource constrained project scheduling problem with sequence dependent setup cost

The resource constrained project scheduling problem with sequence dependent setup cost

Project scheduling with calendars

Project scheduling with calendars

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost

Project management with dynamic scheduling : baseline scheduling, risk analysis and project control

Project management with dynamic scheduling : baseline scheduling, risk analysis and project control

Project managment with dynamic scheduling : baseline scheduling, risk analysis and project control

Project managment with dynamic scheduling : baseline scheduling, risk analysis and project control

Project scheduling with inventory constraints

Project scheduling with inventory constraints

Active and stable project scheduling

Active and stable project scheduling

Project Scheduling with Activity Exchange

Project Scheduling with Activity Exchange

Stochastic resource-constrained project scheduling

Hochschulschrift | Online-Publikation

Stochastic resource-constrained project scheduling

A Multi-objective Optimization Model for Robust Skip-Stop Scheduling with Earliness and Tardiness Penalties

A Multi-objective Optimization Model for Robust Skip-Stop Scheduling with Earliness and Tardiness Penalties

Verbundene Objekte