An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem
Year of publication: |
2020
|
---|---|
Authors: | Carlier, J. ; Pinson, E. ; Sahli, A. ; Jouglet, A. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 286.2020, 2 (16.10.), p. 468-476
|
Subject: | Adjustment | Cumulative resource | Energetic reasoning | Scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
Two enhanced differential evolution algorithms for job shop scheduling problems
Wisittipanich, Warisa, (2012)
-
Approximability of total weighted completion time with resource consuming jobs
Kis, TamaĆ, (2015)
- More ...
-
An algorithm for solving the job-shop problem
Carlier, J., (1989)
-
An Algorithm for Solving the Job-Shop Problem
Carlier, J., (1989)
-
Jackson's Pseudo Preemptive Schedule for the Pm-ri, qi-Cmax scheduling problem
Carlier, J., (1998)
- More ...