On index priority sequencing rules for scheduling with time-dependent job processing times (Q2450686): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2013.05.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2046604814
@@ Property / OpenAlex ID: W2046604814 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with time dependent processing times: Review and extensions
+Normal rank
@@ Property / cites work @@
+Minimizing the total weighted completion time of deteriorating jobs
+Normal rank
@@ Property / cites work @@
+A state-of-the-art review on scheduling with learning effects
+Normal rank
@@ Property / cites work @@
+Scheduling Deteriorating Jobs on a Single Processor
+Normal rank
@@ Property / cites work @@
+A concise survey of scheduling with time-dependent processing times
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+A note on the optimality of index priority rules for search and sequencing problems
+Normal rank
@@ Property / cites work @@
+Scheduling jobs under simple linear deterioration
@@ Property / cites work: Scheduling jobs under simple linear deterioration / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices
+Normal rank
@@ Property / cites work @@
+Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
+Normal rank