Scheduling on parallel dedicated machines with job rejection
Year of publication: |
2024
|
---|---|
Authors: | Mor, Baruch ; Mosheiov, Gur |
Subject: | dynamic programming algorithm | makespan | parallel dedicated machines | Scheduling | total completion time | total load | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Algorithmus | Algorithm | Dynamische Optimierung | Dynamic programming | Heuristik | Heuristics | Produktionssteuerung | Production control |
-
Single machine scheduling problems with generalised due-dates and job-rejection
Gerstl, Enrique, (2017)
-
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi, (2013)
-
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
Cheng, T. C. E., (2021)
- More ...
-
Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime
Mor, Baruch, (2014)
-
Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
Mor, Baruch, (2010)
-
Scheduling a maintenance activity and due-window assignment based on common flow allowance
Mor, Baruch, (2012)
- More ...