Preemptive job-shop scheduling problems with a fixed number of jobs
Year of publication: |
1999
|
---|---|
Authors: | Brucker, Peter ; Kravčenko, Svetlana A. ; Sotskov, Jurij Nazarovič |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 49.1999, 1, p. 41-76
|
Subject: | Scheduling-Verfahren | Scheduling problem | Produktionssteuerung | Production control | Theorie | Theory |
Extent: | Graph. Darst |
---|---|
Type of publication: | Article |
Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
Language: | English |
Notes: | In: Mathematical methods of operations research |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Job shop management of products under internal lifespan and external due date
Gonzalez-R., Pedro L., (2018)
-
Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine
Sánchez, Ana, (2009)
-
Modeling and analysis of a new production methodology for achieving mass customization
Singh, Sanchit, (2024)
- More ...
-
On the complexity of two machine job-shop scheduling with regular objective functions
Brucker, Peter, (1997)
-
Scheduling jobs with equal processing times and time windows on identical parallel machines
Brucker, Peter, (2008)
-
Complexity of shop-scheduling problems with fixed number of jobs : a survey
Brucker, Peter, (2007)
- More ...