NDLI: Einheits-Zeit Reihenfolge Probleme mit zeitabhängigen Ressourcen

Content Provider	Springer Nature Link
Author	Woeginger, G. J. Tautenhahn, T.
Copyright Year	1997
Abstract	We investigate the computational complexity of scheduling problems, where the operations consume certain amounts of renewable resources which are available in time-dependent quantities. In particular, we consider unit-time open shop problems and unit-time scheduling problems with identical parallel processors. For the case where the number of machines, the number of resources and the demand for every resource are all bounded by a constant, we derive polynomial time results for several objective functions. Furthermore, we establish a borderline between hard and easy variants of such problems by proving NP-hardness of most remaining cases.Wir untersuchen die Komplexität einiger Reihenfolgeprobleme, in denen die Abarbeitung der Operationen das Vorhandensein von gewissen Mengen erneuerbarer Ressourcen verlangt, die in zeitabhängigen Mengen verfügbar sind. Wir betrachten Open-Shop Systeme und Systeme mit parallelen Prozessoren mit Einheits-Zeit Operationen. Für den Fall, daß die Anzahl der Maschinen, die Anzahl der Ressourcen und der Ressourcenbedarf jeder Operation durch eine Konstante nach oben beschränkt sind, leiten wir polynomiale Algorithmen für einige Zielfunktionen her. Außerdem ziehen wir eine Grenzlinie zwischen einfachen und schwierigen Varianten, indem wir die NP-vollständigkeit der meisten übrigen Problemvarianten beweisen.
Ending Page	111
Page Count	15
Starting Page	97
File Format	PDF
ISSN	0010485X
e-ISSN	14365057
Journal	Computing
Issue Number	2
Volume Number	58
Language	German
Publisher	Springer-Verlag
Publisher Date	1997-01-01
Publisher Place	Vienna
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Open shop scheduling NP-hardness Analysis of algorithms and problem complexity Computational Mathematics and Numerical Analysis dynamic programming polynomial algorithm parallel processors Scheduling theory, deterministic
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Computational Mathematics Numerical Analysis Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Makespan minimization in preemptive two machine job shops

Scheduling Probleme in parallelen Systemen für Telekommunikation

Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines

Complexity of the scheduling languageRSV

Flow shop scheduling with effects of learning and deterioration

Semi-Online Algorithms for Parallel Machine Scheduling Problems

Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties

ILP Formulations for Optimal Task Scheduling with Communication Delays on Parallel Systems

On relationships between complexity classes of Turing machines

Einheits-Zeit Reihenfolge Probleme mit zeitabhängigen Ressourcen

Similar Documents

Makespan minimization in preemptive two machine job shops

Scheduling Probleme in parallelen Systemen für Telekommunikation

Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines

Complexity of the scheduling languageRSV

Flow shop scheduling with effects of learning and deterioration

Semi-Online Algorithms for Parallel Machine Scheduling Problems

Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties

ILP Formulations for Optimal Task Scheduling with Communication Delays on Parallel Systems

On relationships between complexity classes of Turing machines

Einheits-Zeit Reihenfolge Probleme mit zeitabhängigen Ressourcen