Shop scheduling problems with pliable jobs
| Year of publication: | 
                              2019         | 
|---|---|
| Authors: | Knust, Sigrid ; Shakhlevich, Natasha ; Waldherr, Stefan ; Weiß, Christian | 
| Published in: | 
                  	  	      	    Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 6, p. 635-661      	   | 
| Subject: | Scheduling | Flow shop | Open shop | Identical parallel machines | Preemption | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Konsumentenverhalten | Consumer behaviour | Heuristik | Heuristics | 
- 
                      Two-machine flow shop and open shop scheduling problems with a single maintenance window Mosheiov, Gur, (2018) 
- 
                      
          Zhang, Xiechen, (2025) 
- 
                      
          Belieres, Simon, (2023) 
- More ...
- 
                      Parallel batch scheduling of equal-length jobs with release and due dates Condotta, Alessandro, (2010) 
- 
                      Tabu search and lower bounds for a combined production-transportation problem Condotta, Alessandro, (2013) 
- 
                      Complexity results for storage loading problems with stacking constraints Bruns, Florian, (2016) 
- More ...
