Earliness-Tardiness Scheduling Problems, II : Deviation of Completion Times About a Restrictive Common Due Date
Year of publication: |
[2017]
|
---|---|
Authors: | Hall, Nicholas G. |
Other Persons: | Kubiak, Wieslaw (contributor) ; Sethi, Suresh (contributor) |
Publisher: |
[2017]: [S.l.] : SSRN |
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Terminplanung | Time scheduling |
Extent: | 1 Online-Ressource (10 p) |
---|---|
Type of publication: | Book / Working Paper |
Language: | English |
Notes: | In: Operations Research,Vol. 39, No. 5, pp. 847-856, September - October 1991 Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments 1991 erstellt |
Classification: | M11 - Production Management ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Heuristic Flow-Shop Scheduling to Minimize Sum of Job Completion Times
Sambandam, Narayanasamy, (2020)
-
The block planning approach for continuous time-based dynamic lot sizing and scheduling
Günther, Hans-Otto, (2014)
-
Minimizing Makespan in Flowshops with Pallet Requirements : Computational Complexity
Wang, M. W., (2010)
- More ...
-
Efficient Algorithms for Flexible Job Shop Scheduling with Parallel Machines
Kubiak, Wieslaw, (2020)
-
A Note on "Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems"
Kubiak, Wieslaw, (2017)
-
Complexity of a Class of Nonlinear Combinatorial Problems Related to Their Linear Counterparts
Sethi, Suresh, (2017)
- More ...