Arbeitspapier

Inventory constrained scheduling on a single machine

zu Verbundenen Objekten

This paper studies inventory constraints in a machine scheduling environment. Jobs can add and remove items of different types to the inventory and from the inventory, respectively. Jobs removing items cannot be processed if the required amount of items is not available. We first have a look at general models and determine the computational status of these problems. Since it turns out that general models are strongly NP-hard except for makespan minimization on one machine we have a look at special cases in the following. We determine the computational complexity of all considered special cases for objection functions ∑Cj and Lmax and several special cases for objective functions ∑wjCj and ∑Uj.

Sprache
Englisch

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

Klassifikation
Management
Thema
Machine scheduling
inventory constraints
computational complexity
Scheduling-Verfahren
Lagerhaltungsmodell
Theorie

Ereignis
Geistige Schöpfung
(wer)
Briskorn, Dirk
Choi, Byung-Cheon
Lee, Kangbok
Leung, Joseph
Pinedo, Michael
Ereignis
Veröffentlichung
(wer)
Universität Kiel, Institut für Betriebswirtschaftslehre
(wo)
Kiel
(wann)
2008

Handle
Letzte Aktualisierung
10.03.2025, 11:42 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

  • Briskorn, Dirk
  • Choi, Byung-Cheon
  • Lee, Kangbok
  • Leung, Joseph
  • Pinedo, Michael
  • Universität Kiel, Institut für Betriebswirtschaftslehre

Entstanden

  • 2008

Ähnliche Objekte (12)

Genetic algorithms for inventory constrained scheduling on a single machine

Arbeitspapier

Genetic algorithms for inventory constrained scheduling on a single machine

Multi-level, single-machine lot sizing and scheduling: With initial inventory

Arbeitspapier

Multi-level, single-machine lot sizing and scheduling: With initial inventory

Precedence constrained parallel-machine scheduling of position-dependent jobs

Precedence constrained parallel-machine scheduling of position-dependent jobs

Single Machine Scheduling with Release Dates

Single Machine Scheduling with Release Dates

Single Machine Scheduling with Weighted Nonlinear Cost

Single Machine Scheduling with Weighted Nonlinear Cost

Stochastic resource-constrained project scheduling

Hochschulschrift | Online-Publikation

Stochastic resource-constrained project scheduling

Project scheduling with inventory constraints

Project scheduling with inventory constraints

Risk-averse single machine scheduling: complexity and approximation

Risk-averse single machine scheduling: complexity and approximation

Recoverable robust single machine scheduling with polyhedral uncertainty

Recoverable robust single machine scheduling with polyhedral uncertainty

New insights on the complexity of resource-constrained project scheduling: A case of single-mode scheduling

Arbeitspapier

New insights on the complexity of resource-constrained project scheduling: A case of single-mode scheduling

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

Robust scheduling on a single machine usinge time buffers

Arbeitspapier

Robust scheduling on a single machine usinge time buffers

Verbundene Objekte