Strong NP-hardness of scheduling problems with learning or aging effect (Q363599): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10479-013-1364-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1966570709
@@ Property / OpenAlex ID: W1966570709 / rank @@
+Normal rank
@@ Property / cites work @@
+Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect
+Normal rank
@@ Property / cites work @@
+Scheduling problems with position dependent job processing times: computational complexity results
+Normal rank
@@ Property / cites work @@
+The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
+Normal rank
@@ Property / cites work @@
+On single processor scheduling problems with learning dependent on the number of processed jobs
+Normal rank
@@ Property / cites work @@
+Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with both deterioration and learning effects
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling problems with time and position dependent processing times
+Normal rank