Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times
Year of publication: |
2024
|
---|---|
Authors: | Nouinou, Hajar ; Arbaoui, Taha ; Yalaoui, Alice |
Subject: | competitive analysis | lower bounds | Machine scheduling | sem-online algorithm | total weighted completion time | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Algorithmus | Algorithm |
-
Ma, Ran, (2014)
-
Wei, Hongjun, (2019)
-
Minimising total weighted completion time on batch and unary machines with incompatible job families
Huang, Zewen, (2019)
- More ...
-
Rodoplu, Melek, (2020)
-
Flows optimisation of industrial symbiosis based on bi-objective mathematical modelling
Nouinou, Hajar, (2021)
-
Preprocessing and an improved MIP model for examination timetabling
Arbaoui, Taha, (2015)
- More ...