A branch and bound algorithm for single machine scheduling with deteriorating values of jobs (Q611733): Difference between revisions

@@ Property / cites work @@
+Scheduling Deteriorating Jobs on a Single Processor
+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 @@
+Scheduling with time dependent processing times: Review and extensions
+Normal rank
@@ Property / cites work @@
+A concise survey of scheduling with time-dependent processing times
+Normal rank
@@ Property / cites work @@
+Minimizing the total weighted completion time of deteriorating jobs
+Normal rank
@@ Property / cites work @@
+Scheduling start time dependent jobs to minimize the total weighted completion time
+Normal rank
@@ Property / cites work @@
+Scheduling jobs with piecewise linear decreasing processing times
+Normal rank
@@ Property / cites work @@
+Batching work and rework processes with limited deterioration of reworkables
+Normal rank
@@ Property / cites work @@
+Q3417375
@@ Property / cites work: Q3417375 / rank @@
+Normal rank
@@ Property / cites work @@
+Single processor scheduling with job values depending on their completion times
+Normal rank
@@ Property / cites work @@
+A scheduling problem with job values given as a power function of their completion times
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank